./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 21dc9f7e2ddd4ffb05ac36477bf46e7266bc68ad137742c8de338dbab6571869 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:49:32,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:49:32,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:49:32,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:49:32,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:49:32,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:49:32,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:49:32,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:49:32,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:49:32,746 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:49:32,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:49:32,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:49:32,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:49:32,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:49:32,752 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:49:32,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:49:32,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:49:32,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:49:32,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:49:32,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:49:32,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:49:32,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:49:32,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:49:32,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:49:32,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:49:32,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:49:32,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:49:32,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:49:32,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:49:32,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:49:32,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:49:32,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:49:32,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:49:32,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:49:32,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:49:32,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:49:32,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:49:32,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:49:32,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:49:32,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:49:32,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:49:32,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:49:32,761 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21dc9f7e2ddd4ffb05ac36477bf46e7266bc68ad137742c8de338dbab6571869 [2024-10-14 02:49:33,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:49:33,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:49:33,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:49:33,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:49:33,062 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:49:33,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c [2024-10-14 02:49:34,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:49:34,854 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:49:34,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c [2024-10-14 02:49:34,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2c200db/d5868ffa8db84c218f92f2a8163f3d1a/FLAG646a3bfc1 [2024-10-14 02:49:35,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2c200db/d5868ffa8db84c218f92f2a8163f3d1a [2024-10-14 02:49:35,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:49:35,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:49:35,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:49:35,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:49:35,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:49:35,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:35,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a84f704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35, skipping insertion in model container [2024-10-14 02:49:35,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:35,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:49:35,408 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c[5910,5923] [2024-10-14 02:49:35,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:49:35,696 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:49:35,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [48] [2024-10-14 02:49:35,707 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [169] [2024-10-14 02:49:35,707 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [183] [2024-10-14 02:49:35,708 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [284] [2024-10-14 02:49:35,708 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [293] [2024-10-14 02:49:35,708 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [960] [2024-10-14 02:49:35,709 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1122] [2024-10-14 02:49:35,709 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2737] [2024-10-14 02:49:35,709 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2775] [2024-10-14 02:49:35,709 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3141] [2024-10-14 02:49:35,723 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c[5910,5923] [2024-10-14 02:49:35,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:49:35,927 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:49:35,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35 WrapperNode [2024-10-14 02:49:35,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:49:35,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:49:35,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:49:35,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:49:35,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:35,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,012 INFO L138 Inliner]: procedures = 97, calls = 346, calls flagged for inlining = 28, calls inlined = 25, statements flattened = 924 [2024-10-14 02:49:36,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:49:36,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:49:36,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:49:36,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:49:36,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,077 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-14 02:49:36,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:49:36,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:49:36,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:49:36,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:49:36,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (1/1) ... [2024-10-14 02:49:36,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:49:36,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:49:36,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:49:36,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:49:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-14 02:49:36,255 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-14 02:49:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:49:36,255 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:49:36,255 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:49:36,255 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:49:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:49:36,256 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:49:36,256 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:49:36,257 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:49:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:49:36,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:49:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:49:36,257 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:49:36,257 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:49:36,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:49:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-14 02:49:36,258 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-14 02:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:49:36,259 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:49:36,259 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-14 02:49:36,259 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-14 02:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:49:36,259 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:49:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-14 02:49:36,259 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-14 02:49:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:49:36,260 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:49:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:49:36,260 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:49:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:49:36,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:49:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:49:36,263 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:49:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:49:36,263 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:49:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:49:36,263 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:49:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:49:36,263 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:49:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:49:36,264 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:49:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:49:36,264 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:49:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-10-14 02:49:36,264 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-10-14 02:49:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:49:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:49:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:49:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:49:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:49:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:49:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:49:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:49:36,266 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:49:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:49:36,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:49:36,268 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:49:36,268 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:49:36,486 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:49:36,489 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:49:37,717 INFO L? ?]: Removed 477 outVars from TransFormulas that were not future-live. [2024-10-14 02:49:37,717 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:49:37,809 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:49:37,810 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:49:37,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:49:37 BoogieIcfgContainer [2024-10-14 02:49:37,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:49:37,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:49:37,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:49:37,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:49:37,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:49:35" (1/3) ... [2024-10-14 02:49:37,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592a163e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:49:37, skipping insertion in model container [2024-10-14 02:49:37,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:35" (2/3) ... [2024-10-14 02:49:37,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592a163e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:49:37, skipping insertion in model container [2024-10-14 02:49:37,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:49:37" (3/3) ... [2024-10-14 02:49:37,819 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product31.cil.c [2024-10-14 02:49:37,837 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:49:37,838 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:49:37,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:49:37,937 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5febe0b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:49:37,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:49:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 565 states, 438 states have (on average 1.7168949771689497) internal successors, (752), 459 states have internal predecessors, (752), 99 states have call successors, (99), 26 states have call predecessors, (99), 26 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-14 02:49:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 02:49:37,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:37,980 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:37,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:37,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1752086407, now seen corresponding path program 1 times [2024-10-14 02:49:37,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:37,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259783847] [2024-10-14 02:49:37,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:37,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:38,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:38,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:49:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:49:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:49:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:49:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:49:39,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:39,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259783847] [2024-10-14 02:49:39,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259783847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:39,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:39,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 02:49:39,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137549680] [2024-10-14 02:49:39,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:39,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 02:49:39,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:39,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 02:49:39,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:39,463 INFO L87 Difference]: Start difference. First operand has 565 states, 438 states have (on average 1.7168949771689497) internal successors, (752), 459 states have internal predecessors, (752), 99 states have call successors, (99), 26 states have call predecessors, (99), 26 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:49:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:49,291 INFO L93 Difference]: Finished difference Result 1991 states and 3447 transitions. [2024-10-14 02:49:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 02:49:49,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2024-10-14 02:49:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:49,335 INFO L225 Difference]: With dead ends: 1991 [2024-10-14 02:49:49,335 INFO L226 Difference]: Without dead ends: 1432 [2024-10-14 02:49:49,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:49:49,349 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 2734 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 6086 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2819 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 6902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 6086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:49,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2819 Valid, 2576 Invalid, 6902 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [816 Valid, 6086 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-10-14 02:49:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2024-10-14 02:49:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1070. [2024-10-14 02:49:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 833 states have (on average 1.7046818727490995) internal successors, (1420), 865 states have internal predecessors, (1420), 188 states have call successors, (188), 46 states have call predecessors, (188), 48 states have return successors, (192), 182 states have call predecessors, (192), 183 states have call successors, (192) [2024-10-14 02:49:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1800 transitions. [2024-10-14 02:49:49,803 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1800 transitions. Word has length 93 [2024-10-14 02:49:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:49,804 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1800 transitions. [2024-10-14 02:49:49,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:49:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1800 transitions. [2024-10-14 02:49:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 02:49:49,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:49,814 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:49,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:49:49,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:49,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:49,816 INFO L85 PathProgramCache]: Analyzing trace with hash -216339823, now seen corresponding path program 1 times [2024-10-14 02:49:49,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:49,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258837918] [2024-10-14 02:49:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:49,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:49:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:49:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:49:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:49:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:49:50,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:50,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258837918] [2024-10-14 02:49:50,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258837918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:50,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:50,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:49:50,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564801163] [2024-10-14 02:49:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:50,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:49:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:50,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:49:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:49:50,555 INFO L87 Difference]: Start difference. First operand 1070 states and 1800 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:49:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:55,807 INFO L93 Difference]: Finished difference Result 2464 states and 4205 transitions. [2024-10-14 02:49:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:49:55,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2024-10-14 02:49:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:55,821 INFO L225 Difference]: With dead ends: 2464 [2024-10-14 02:49:55,821 INFO L226 Difference]: Without dead ends: 1406 [2024-10-14 02:49:55,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:49:55,831 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 981 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:55,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 1520 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 02:49:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-14 02:49:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1070. [2024-10-14 02:49:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 833 states have (on average 1.703481392557023) internal successors, (1419), 865 states have internal predecessors, (1419), 188 states have call successors, (188), 46 states have call predecessors, (188), 48 states have return successors, (192), 182 states have call predecessors, (192), 183 states have call successors, (192) [2024-10-14 02:49:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1799 transitions. [2024-10-14 02:49:56,074 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1799 transitions. Word has length 95 [2024-10-14 02:49:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:56,074 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1799 transitions. [2024-10-14 02:49:56,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:49:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1799 transitions. [2024-10-14 02:49:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:49:56,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:56,079 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:49:56,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:49:56,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:56,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1853347956, now seen corresponding path program 1 times [2024-10-14 02:49:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145166544] [2024-10-14 02:49:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:49:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:49:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:49:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:49:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:49:56,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:56,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145166544] [2024-10-14 02:49:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145166544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:56,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:56,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:49:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503938036] [2024-10-14 02:49:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:56,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:49:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:56,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:49:56,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:49:56,830 INFO L87 Difference]: Start difference. First operand 1070 states and 1799 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:01,846 INFO L93 Difference]: Finished difference Result 2464 states and 4204 transitions. [2024-10-14 02:50:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:50:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 96 [2024-10-14 02:50:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:01,858 INFO L225 Difference]: With dead ends: 2464 [2024-10-14 02:50:01,858 INFO L226 Difference]: Without dead ends: 1406 [2024-10-14 02:50:01,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:50:01,866 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 977 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 3113 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 3113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:01,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1531 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 3113 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 02:50:01,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-14 02:50:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1070. [2024-10-14 02:50:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 833 states have (on average 1.702280912364946) internal successors, (1418), 865 states have internal predecessors, (1418), 188 states have call successors, (188), 46 states have call predecessors, (188), 48 states have return successors, (192), 182 states have call predecessors, (192), 183 states have call successors, (192) [2024-10-14 02:50:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1798 transitions. [2024-10-14 02:50:02,083 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1798 transitions. Word has length 96 [2024-10-14 02:50:02,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:02,084 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1798 transitions. [2024-10-14 02:50:02,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1798 transitions. [2024-10-14 02:50:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 02:50:02,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:02,088 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:02,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:50:02,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:02,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:02,089 INFO L85 PathProgramCache]: Analyzing trace with hash -400227731, now seen corresponding path program 1 times [2024-10-14 02:50:02,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:02,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831341361] [2024-10-14 02:50:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:02,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:50:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:50:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:50:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:50:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:50:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:50:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:50:02,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:02,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831341361] [2024-10-14 02:50:02,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831341361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:02,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:02,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:02,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768857577] [2024-10-14 02:50:02,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:02,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:02,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:02,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:02,729 INFO L87 Difference]: Start difference. First operand 1070 states and 1798 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:07,270 INFO L93 Difference]: Finished difference Result 2464 states and 4203 transitions. [2024-10-14 02:50:07,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:50:07,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2024-10-14 02:50:07,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:07,282 INFO L225 Difference]: With dead ends: 2464 [2024-10-14 02:50:07,282 INFO L226 Difference]: Without dead ends: 1406 [2024-10-14 02:50:07,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:50:07,288 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1447 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 3023 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 3388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 3023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:07,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1480 Invalid, 3388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 3023 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-14 02:50:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-14 02:50:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1070. [2024-10-14 02:50:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 833 states have (on average 1.7010804321728692) internal successors, (1417), 865 states have internal predecessors, (1417), 188 states have call successors, (188), 46 states have call predecessors, (188), 48 states have return successors, (192), 182 states have call predecessors, (192), 183 states have call successors, (192) [2024-10-14 02:50:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1797 transitions. [2024-10-14 02:50:07,595 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1797 transitions. Word has length 97 [2024-10-14 02:50:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:07,595 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1797 transitions. [2024-10-14 02:50:07,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1797 transitions. [2024-10-14 02:50:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 02:50:07,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:07,599 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:07,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:50:07,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:07,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash 763982608, now seen corresponding path program 1 times [2024-10-14 02:50:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:07,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558867678] [2024-10-14 02:50:07,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:07,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:07,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:50:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:50:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:50:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:50:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:50:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:50:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:50:08,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:08,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558867678] [2024-10-14 02:50:08,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558867678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:08,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:08,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458038887] [2024-10-14 02:50:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:08,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:08,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:08,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:08,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:08,211 INFO L87 Difference]: Start difference. First operand 1070 states and 1797 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:12,923 INFO L93 Difference]: Finished difference Result 2464 states and 4202 transitions. [2024-10-14 02:50:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:50:12,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2024-10-14 02:50:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:12,932 INFO L225 Difference]: With dead ends: 2464 [2024-10-14 02:50:12,932 INFO L226 Difference]: Without dead ends: 1406 [2024-10-14 02:50:12,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:50:12,938 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 1438 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 3022 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 3022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:12,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1502 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 3022 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 02:50:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-14 02:50:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1070. [2024-10-14 02:50:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 833 states have (on average 1.6998799519807923) internal successors, (1416), 865 states have internal predecessors, (1416), 188 states have call successors, (188), 46 states have call predecessors, (188), 48 states have return successors, (192), 182 states have call predecessors, (192), 183 states have call successors, (192) [2024-10-14 02:50:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1796 transitions. [2024-10-14 02:50:13,136 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1796 transitions. Word has length 98 [2024-10-14 02:50:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:13,137 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1796 transitions. [2024-10-14 02:50:13,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1796 transitions. [2024-10-14 02:50:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 02:50:13,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:13,141 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:13,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:50:13,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:13,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 505377353, now seen corresponding path program 1 times [2024-10-14 02:50:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:13,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000909283] [2024-10-14 02:50:13,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:50:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:50:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:50:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:50:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:50:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:50:13,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:13,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000909283] [2024-10-14 02:50:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000909283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:13,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:13,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:50:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529876923] [2024-10-14 02:50:13,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:13,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:50:13,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:13,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:50:13,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:50:13,869 INFO L87 Difference]: Start difference. First operand 1070 states and 1796 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 02:50:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:19,854 INFO L93 Difference]: Finished difference Result 2440 states and 4151 transitions. [2024-10-14 02:50:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:50:19,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 99 [2024-10-14 02:50:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:19,864 INFO L225 Difference]: With dead ends: 2440 [2024-10-14 02:50:19,864 INFO L226 Difference]: Without dead ends: 1430 [2024-10-14 02:50:19,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-14 02:50:19,871 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 2023 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 5384 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 5914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 5384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:19,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2103 Valid, 2607 Invalid, 5914 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [530 Valid, 5384 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 02:50:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-10-14 02:50:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1082. [2024-10-14 02:50:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 842 states have (on average 1.6983372921615203) internal successors, (1430), 876 states have internal predecessors, (1430), 189 states have call successors, (189), 46 states have call predecessors, (189), 50 states have return successors, (195), 183 states have call predecessors, (195), 184 states have call successors, (195) [2024-10-14 02:50:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1814 transitions. [2024-10-14 02:50:20,227 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1814 transitions. Word has length 99 [2024-10-14 02:50:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:20,228 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1814 transitions. [2024-10-14 02:50:20,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 02:50:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1814 transitions. [2024-10-14 02:50:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 02:50:20,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:20,236 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:20,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:50:20,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:20,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:20,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2139453144, now seen corresponding path program 1 times [2024-10-14 02:50:20,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:20,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825494885] [2024-10-14 02:50:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:20,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:50:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:50:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:50:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:50:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:50:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:50:20,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825494885] [2024-10-14 02:50:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825494885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:20,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:20,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053947355] [2024-10-14 02:50:20,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:20,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:20,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:20,867 INFO L87 Difference]: Start difference. First operand 1082 states and 1814 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:25,385 INFO L93 Difference]: Finished difference Result 2462 states and 4189 transitions. [2024-10-14 02:50:25,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:50:25,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2024-10-14 02:50:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:25,396 INFO L225 Difference]: With dead ends: 2462 [2024-10-14 02:50:25,396 INFO L226 Difference]: Without dead ends: 1436 [2024-10-14 02:50:25,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:50:25,402 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 1044 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 3081 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 3081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:25,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1543 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 3081 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 02:50:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2024-10-14 02:50:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1082. [2024-10-14 02:50:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 842 states have (on average 1.6923990498812351) internal successors, (1425), 876 states have internal predecessors, (1425), 189 states have call successors, (189), 46 states have call predecessors, (189), 50 states have return successors, (195), 183 states have call predecessors, (195), 184 states have call successors, (195) [2024-10-14 02:50:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1809 transitions. [2024-10-14 02:50:25,653 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1809 transitions. Word has length 99 [2024-10-14 02:50:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:25,653 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1809 transitions. [2024-10-14 02:50:25,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1809 transitions. [2024-10-14 02:50:25,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 02:50:25,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:25,659 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:25,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:50:25,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:25,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash 723889429, now seen corresponding path program 1 times [2024-10-14 02:50:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:25,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426056215] [2024-10-14 02:50:25,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:50:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:50:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:50:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:50:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:50:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:50:26,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:26,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426056215] [2024-10-14 02:50:26,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426056215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:26,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:26,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:26,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858585790] [2024-10-14 02:50:26,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:26,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:26,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:26,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:26,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:26,241 INFO L87 Difference]: Start difference. First operand 1082 states and 1809 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:30,657 INFO L93 Difference]: Finished difference Result 2462 states and 4184 transitions. [2024-10-14 02:50:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:50:30,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2024-10-14 02:50:30,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:30,668 INFO L225 Difference]: With dead ends: 2462 [2024-10-14 02:50:30,668 INFO L226 Difference]: Without dead ends: 1436 [2024-10-14 02:50:30,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:50:30,674 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 1038 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 3056 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 3056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:30,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1543 Invalid, 3262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 3056 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-14 02:50:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2024-10-14 02:50:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1082. [2024-10-14 02:50:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 842 states have (on average 1.6864608076009502) internal successors, (1420), 876 states have internal predecessors, (1420), 189 states have call successors, (189), 46 states have call predecessors, (189), 50 states have return successors, (195), 183 states have call predecessors, (195), 184 states have call successors, (195) [2024-10-14 02:50:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1804 transitions. [2024-10-14 02:50:30,970 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1804 transitions. Word has length 100 [2024-10-14 02:50:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:30,970 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1804 transitions. [2024-10-14 02:50:30,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1804 transitions. [2024-10-14 02:50:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 02:50:30,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:30,977 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:30,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:50:30,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:30,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash 943568077, now seen corresponding path program 1 times [2024-10-14 02:50:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:30,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348340279] [2024-10-14 02:50:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:30,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:50:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:50:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:50:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:50:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:50:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:50:31,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:31,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348340279] [2024-10-14 02:50:31,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348340279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:31,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:31,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797829307] [2024-10-14 02:50:31,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:31,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:31,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:31,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:31,700 INFO L87 Difference]: Start difference. First operand 1082 states and 1804 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:36,123 INFO L93 Difference]: Finished difference Result 2462 states and 4179 transitions. [2024-10-14 02:50:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:50:36,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 101 [2024-10-14 02:50:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:36,132 INFO L225 Difference]: With dead ends: 2462 [2024-10-14 02:50:36,133 INFO L226 Difference]: Without dead ends: 1436 [2024-10-14 02:50:36,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:50:36,138 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 1038 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 3015 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:36,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1542 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3015 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 02:50:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2024-10-14 02:50:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1082. [2024-10-14 02:50:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 842 states have (on average 1.680522565320665) internal successors, (1415), 876 states have internal predecessors, (1415), 189 states have call successors, (189), 46 states have call predecessors, (189), 50 states have return successors, (195), 183 states have call predecessors, (195), 184 states have call successors, (195) [2024-10-14 02:50:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1799 transitions. [2024-10-14 02:50:36,370 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1799 transitions. Word has length 101 [2024-10-14 02:50:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1799 transitions. [2024-10-14 02:50:36,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1799 transitions. [2024-10-14 02:50:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 02:50:36,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:36,375 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:36,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:50:36,376 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:36,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1387203782, now seen corresponding path program 1 times [2024-10-14 02:50:36,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:36,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074791686] [2024-10-14 02:50:36,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:36,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:50:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:50:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:37,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:50:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:50:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:37,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:50:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:50:37,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:37,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074791686] [2024-10-14 02:50:37,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074791686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:37,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:37,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:50:37,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124780286] [2024-10-14 02:50:37,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:37,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:50:37,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:37,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:50:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:50:37,013 INFO L87 Difference]: Start difference. First operand 1082 states and 1799 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 02:50:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:43,297 INFO L93 Difference]: Finished difference Result 2442 states and 4137 transitions. [2024-10-14 02:50:43,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:50:43,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 102 [2024-10-14 02:50:43,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:43,308 INFO L225 Difference]: With dead ends: 2442 [2024-10-14 02:50:43,308 INFO L226 Difference]: Without dead ends: 1430 [2024-10-14 02:50:43,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:50:43,313 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1012 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 5413 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 5620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 5413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:43,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 2709 Invalid, 5620 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [207 Valid, 5413 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 02:50:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-10-14 02:50:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1082. [2024-10-14 02:50:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 842 states have (on average 1.6793349168646081) internal successors, (1414), 876 states have internal predecessors, (1414), 189 states have call successors, (189), 46 states have call predecessors, (189), 50 states have return successors, (195), 183 states have call predecessors, (195), 184 states have call successors, (195) [2024-10-14 02:50:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1798 transitions. [2024-10-14 02:50:43,520 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1798 transitions. Word has length 102 [2024-10-14 02:50:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:43,521 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1798 transitions. [2024-10-14 02:50:43,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 02:50:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1798 transitions. [2024-10-14 02:50:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 02:50:43,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:43,525 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:43,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:50:43,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:43,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 814043674, now seen corresponding path program 1 times [2024-10-14 02:50:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388259154] [2024-10-14 02:50:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:50:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:50:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:50:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:50:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:50:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:50:44,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:44,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388259154] [2024-10-14 02:50:44,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388259154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:44,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:44,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003961502] [2024-10-14 02:50:44,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:44,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:44,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:44,083 INFO L87 Difference]: Start difference. First operand 1082 states and 1798 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:48,116 INFO L93 Difference]: Finished difference Result 2462 states and 4170 transitions. [2024-10-14 02:50:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:50:48,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 102 [2024-10-14 02:50:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:48,125 INFO L225 Difference]: With dead ends: 2462 [2024-10-14 02:50:48,125 INFO L226 Difference]: Without dead ends: 1436 [2024-10-14 02:50:48,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:50:48,129 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1512 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 2821 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 3186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 2821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:48,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 1485 Invalid, 3186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 2821 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 02:50:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2024-10-14 02:50:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1082. [2024-10-14 02:50:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 842 states have (on average 1.673396674584323) internal successors, (1409), 876 states have internal predecessors, (1409), 189 states have call successors, (189), 46 states have call predecessors, (189), 50 states have return successors, (195), 183 states have call predecessors, (195), 184 states have call successors, (195) [2024-10-14 02:50:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1793 transitions. [2024-10-14 02:50:48,345 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1793 transitions. Word has length 102 [2024-10-14 02:50:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:48,346 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1793 transitions. [2024-10-14 02:50:48,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1793 transitions. [2024-10-14 02:50:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 02:50:48,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:48,350 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:50:48,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:50:48,350 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:48,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:48,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1504474032, now seen corresponding path program 1 times [2024-10-14 02:50:48,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:48,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144758435] [2024-10-14 02:50:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:48,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:50:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:50:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:50:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:50:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:50:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:50:48,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:48,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144758435] [2024-10-14 02:50:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144758435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:48,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675856063] [2024-10-14 02:50:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:48,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:48,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:48,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:48,966 INFO L87 Difference]: Start difference. First operand 1082 states and 1793 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:50:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:53,653 INFO L93 Difference]: Finished difference Result 2446 states and 4136 transitions. [2024-10-14 02:50:53,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:50:53,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 103 [2024-10-14 02:50:53,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:53,662 INFO L225 Difference]: With dead ends: 2446 [2024-10-14 02:50:53,663 INFO L226 Difference]: Without dead ends: 1432 [2024-10-14 02:50:53,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:50:53,667 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1002 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 2929 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 3133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:53,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1537 Invalid, 3133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2929 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 02:50:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states.