./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_spec2_product32.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_spec2_product32.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 256d604ca5845ed70fae4c0c59880096896900821991ad09252cbc35739a584c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:46:07,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:46:08,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:46:08,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:46:08,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:46:08,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:46:08,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:46:08,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:46:08,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:46:08,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:46:08,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:46:08,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:46:08,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:46:08,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:46:08,042 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:46:08,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:46:08,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:46:08,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:46:08,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:46:08,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:46:08,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:46:08,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:46:08,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:46:08,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:46:08,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:46:08,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:46:08,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:46:08,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:46:08,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:46:08,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:46:08,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:46:08,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:46:08,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:46:08,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:46:08,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:46:08,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:46:08,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:46:08,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:46:08,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:46:08,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:46:08,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:46:08,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:46:08,053 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 -> 256d604ca5845ed70fae4c0c59880096896900821991ad09252cbc35739a584c [2024-10-14 02:46:08,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:46:08,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:46:08,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:46:08,391 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:46:08,392 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:46:08,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c [2024-10-14 02:46:09,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:46:10,182 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:46:10,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c [2024-10-14 02:46:10,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a563b193/6cb3b9ca11d34ca2a8856ebaedd1daec/FLAG823fa2958 [2024-10-14 02:46:10,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a563b193/6cb3b9ca11d34ca2a8856ebaedd1daec [2024-10-14 02:46:10,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:46:10,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:46:10,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:46:10,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:46:10,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:46:10,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:46:10" (1/1) ... [2024-10-14 02:46:10,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f24757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:10, skipping insertion in model container [2024-10-14 02:46:10,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:46:10" (1/1) ... [2024-10-14 02:46:10,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:46:10,905 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_spec2_product32.cil.c[40079,40092] [2024-10-14 02:46:10,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:46:11,016 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:46:11,031 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [48] [2024-10-14 02:46:11,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [236] [2024-10-14 02:46:11,034 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [904] [2024-10-14 02:46:11,037 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1270] [2024-10-14 02:46:11,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1308] [2024-10-14 02:46:11,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1406] [2024-10-14 02:46:11,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1420] [2024-10-14 02:46:11,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1540] [2024-10-14 02:46:11,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1891] [2024-10-14 02:46:11,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1900] [2024-10-14 02:46:11,133 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_spec2_product32.cil.c[40079,40092] [2024-10-14 02:46:11,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:46:11,238 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:46:11,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11 WrapperNode [2024-10-14 02:46:11,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:46:11,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:46:11,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:46:11,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:46:11,247 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:46:11" (1/1) ... [2024-10-14 02:46:11,279 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:46:11" (1/1) ... [2024-10-14 02:46:11,318 INFO L138 Inliner]: procedures = 99, calls = 355, calls flagged for inlining = 29, calls inlined = 25, statements flattened = 980 [2024-10-14 02:46:11,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:46:11,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:46:11,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:46:11,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:46:11,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (1/1) ... [2024-10-14 02:46:11,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (1/1) ... [2024-10-14 02:46:11,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (1/1) ... [2024-10-14 02:46:11,369 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 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:46:11,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (1/1) ... [2024-10-14 02:46:11,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (1/1) ... [2024-10-14 02:46:11,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (1/1) ... [2024-10-14 02:46:11,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (1/1) ... [2024-10-14 02:46:11,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (1/1) ... [2024-10-14 02:46:11,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (1/1) ... [2024-10-14 02:46:11,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:46:11,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:46:11,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:46:11,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:46:11,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (1/1) ... [2024-10-14 02:46:11,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:46:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:46:11,482 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:46:11,488 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:46:11,568 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-14 02:46:11,568 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-14 02:46:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:46:11,569 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:46:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:46:11,569 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:46:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:46:11,569 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:46:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:46:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:46:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:46:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:46:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:46:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:46:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:46:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:46:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-14 02:46:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-14 02:46:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:46:11,572 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:46:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:46:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:46:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:46:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-14 02:46:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-14 02:46:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:46:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:46:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-14 02:46:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-14 02:46:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:46:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:46:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:46:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:46:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-14 02:46:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-14 02:46:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:46:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:46:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:46:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:46:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:46:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:46:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:46:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:46:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:46:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:46:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:46:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:46:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:46:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:46:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:46:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:46:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:46:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:46:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:46:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:46:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:46:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:46:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:46:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:46:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:46:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:46:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:46:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:46:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:46:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-14 02:46:11,582 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-14 02:46:11,791 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:46:11,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:46:13,013 INFO L? ?]: Removed 485 outVars from TransFormulas that were not future-live. [2024-10-14 02:46:13,013 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:46:13,131 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:46:13,132 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:46:13,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:46:13 BoogieIcfgContainer [2024-10-14 02:46:13,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:46:13,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:46:13,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:46:13,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:46:13,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:46:10" (1/3) ... [2024-10-14 02:46:13,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f850dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:46:13, skipping insertion in model container [2024-10-14 02:46:13,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:46:11" (2/3) ... [2024-10-14 02:46:13,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f850dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:46:13, skipping insertion in model container [2024-10-14 02:46:13,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:46:13" (3/3) ... [2024-10-14 02:46:13,142 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product32.cil.c [2024-10-14 02:46:13,165 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:46:13,165 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:46:13,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:46:13,255 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;@8c39bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:46:13,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:46:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 583 states, 449 states have (on average 1.710467706013363) internal successors, (768), 472 states have internal predecessors, (768), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-14 02:46:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 02:46:13,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:13,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:13,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:13,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash 794055156, now seen corresponding path program 1 times [2024-10-14 02:46:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:13,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836875467] [2024-10-14 02:46:13,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:13,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:14,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:46:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:46:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:46:14,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:14,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836875467] [2024-10-14 02:46:14,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836875467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:14,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:14,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:46:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191056996] [2024-10-14 02:46:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:14,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:46:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:14,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:46:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:46:14,679 INFO L87 Difference]: Start difference. First operand has 583 states, 449 states have (on average 1.710467706013363) internal successors, (768), 472 states have internal predecessors, (768), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:19,834 INFO L93 Difference]: Finished difference Result 1311 states and 2227 transitions. [2024-10-14 02:46:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:46:19,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-10-14 02:46:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:19,868 INFO L225 Difference]: With dead ends: 1311 [2024-10-14 02:46:19,868 INFO L226 Difference]: Without dead ends: 737 [2024-10-14 02:46:19,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:46:19,880 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1191 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 2775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:19,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 1092 Invalid, 3054 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [279 Valid, 2775 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 02:46:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-14 02:46:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 579. [2024-10-14 02:46:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 447 states have (on average 1.7002237136465324) internal successors, (760), 468 states have internal predecessors, (760), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:46:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 965 transitions. [2024-10-14 02:46:20,096 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 965 transitions. Word has length 50 [2024-10-14 02:46:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:20,096 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 965 transitions. [2024-10-14 02:46:20,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 965 transitions. [2024-10-14 02:46:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 02:46:20,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:20,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:20,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:46:20,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:20,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:20,105 INFO L85 PathProgramCache]: Analyzing trace with hash -931298827, now seen corresponding path program 1 times [2024-10-14 02:46:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:20,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240503698] [2024-10-14 02:46:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:20,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:46:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:46:20,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:20,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240503698] [2024-10-14 02:46:20,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240503698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:20,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:20,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:46:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143416369] [2024-10-14 02:46:20,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:20,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:46:20,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:20,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:46:20,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:46:20,774 INFO L87 Difference]: Start difference. First operand 579 states and 965 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:25,039 INFO L93 Difference]: Finished difference Result 1304 states and 2200 transitions. [2024-10-14 02:46:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:46:25,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-10-14 02:46:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:25,050 INFO L225 Difference]: With dead ends: 1304 [2024-10-14 02:46:25,051 INFO L226 Difference]: Without dead ends: 737 [2024-10-14 02:46:25,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:46:25,057 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1192 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 2766 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:25,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1063 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2766 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-14 02:46:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-14 02:46:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 579. [2024-10-14 02:46:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 447 states have (on average 1.6979865771812082) internal successors, (759), 468 states have internal predecessors, (759), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:46:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 964 transitions. [2024-10-14 02:46:25,155 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 964 transitions. Word has length 52 [2024-10-14 02:46:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:25,155 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 964 transitions. [2024-10-14 02:46:25,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 964 transitions. [2024-10-14 02:46:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 02:46:25,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:25,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:25,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:46:25,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:25,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:25,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1531600199, now seen corresponding path program 1 times [2024-10-14 02:46:25,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:25,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377048718] [2024-10-14 02:46:25,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:25,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:25,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:46:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:46:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:25,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:46:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377048718] [2024-10-14 02:46:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377048718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:25,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:46:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419140635] [2024-10-14 02:46:25,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:25,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:46:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:46:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:46:25,759 INFO L87 Difference]: Start difference. First operand 579 states and 964 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:29,949 INFO L93 Difference]: Finished difference Result 1304 states and 2199 transitions. [2024-10-14 02:46:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:46:29,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-10-14 02:46:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:29,954 INFO L225 Difference]: With dead ends: 1304 [2024-10-14 02:46:29,954 INFO L226 Difference]: Without dead ends: 737 [2024-10-14 02:46:29,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:46:29,959 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 719 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 3038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:29,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1050 Invalid, 3038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-14 02:46:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-14 02:46:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 579. [2024-10-14 02:46:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 447 states have (on average 1.6957494407158837) internal successors, (758), 468 states have internal predecessors, (758), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:46:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 963 transitions. [2024-10-14 02:46:30,056 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 963 transitions. Word has length 53 [2024-10-14 02:46:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:30,056 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 963 transitions. [2024-10-14 02:46:30,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 963 transitions. [2024-10-14 02:46:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 02:46:30,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:30,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:30,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:46:30,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:30,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1174100871, now seen corresponding path program 1 times [2024-10-14 02:46:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:30,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640577039] [2024-10-14 02:46:30,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:30,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:30,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:46:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:30,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:46:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:30,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:30,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:46:30,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:30,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640577039] [2024-10-14 02:46:30,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640577039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:30,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:30,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:46:30,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316880407] [2024-10-14 02:46:30,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:30,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:46:30,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:30,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:46:30,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:46:30,648 INFO L87 Difference]: Start difference. First operand 579 states and 963 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:34,678 INFO L93 Difference]: Finished difference Result 1304 states and 2198 transitions. [2024-10-14 02:46:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:46:34,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-10-14 02:46:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:34,683 INFO L225 Difference]: With dead ends: 1304 [2024-10-14 02:46:34,684 INFO L226 Difference]: Without dead ends: 737 [2024-10-14 02:46:34,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:46:34,687 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1182 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 2766 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 2766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:34,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 1090 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 2766 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 02:46:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-14 02:46:34,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 579. [2024-10-14 02:46:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 447 states have (on average 1.6935123042505593) internal successors, (757), 468 states have internal predecessors, (757), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:46:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 962 transitions. [2024-10-14 02:46:34,776 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 962 transitions. Word has length 54 [2024-10-14 02:46:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:34,777 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 962 transitions. [2024-10-14 02:46:34,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 962 transitions. [2024-10-14 02:46:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 02:46:34,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:34,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:34,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:46:34,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:34,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1189550915, now seen corresponding path program 1 times [2024-10-14 02:46:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457952961] [2024-10-14 02:46:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:34,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:34,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:34,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:46:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:35,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:46:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:35,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:35,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:46:35,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:35,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457952961] [2024-10-14 02:46:35,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457952961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:35,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:35,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:46:35,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453580415] [2024-10-14 02:46:35,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:35,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:46:35,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:35,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:46:35,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:46:35,322 INFO L87 Difference]: Start difference. First operand 579 states and 962 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:39,195 INFO L93 Difference]: Finished difference Result 1304 states and 2197 transitions. [2024-10-14 02:46:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:46:39,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2024-10-14 02:46:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:39,202 INFO L225 Difference]: With dead ends: 1304 [2024-10-14 02:46:39,202 INFO L226 Difference]: Without dead ends: 737 [2024-10-14 02:46:39,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:46:39,205 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1180 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 2756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:39,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1084 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 2756 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 02:46:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-14 02:46:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 579. [2024-10-14 02:46:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 447 states have (on average 1.691275167785235) internal successors, (756), 468 states have internal predecessors, (756), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:46:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 961 transitions. [2024-10-14 02:46:39,301 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 961 transitions. Word has length 55 [2024-10-14 02:46:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:39,301 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 961 transitions. [2024-10-14 02:46:39,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 961 transitions. [2024-10-14 02:46:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 02:46:39,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:39,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:39,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:46:39,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:39,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:39,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1582270082, now seen corresponding path program 1 times [2024-10-14 02:46:39,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:39,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40536182] [2024-10-14 02:46:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:39,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:39,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:39,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:46:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:39,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:46:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:46:39,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:39,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40536182] [2024-10-14 02:46:39,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40536182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:39,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:39,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:46:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743880773] [2024-10-14 02:46:39,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:39,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:46:39,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:39,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:46:39,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:46:39,850 INFO L87 Difference]: Start difference. First operand 579 states and 961 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:43,495 INFO L93 Difference]: Finished difference Result 1274 states and 2136 transitions. [2024-10-14 02:46:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:46:43,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2024-10-14 02:46:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:43,501 INFO L225 Difference]: With dead ends: 1274 [2024-10-14 02:46:43,501 INFO L226 Difference]: Without dead ends: 747 [2024-10-14 02:46:43,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:46:43,504 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1249 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:43,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1054 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 02:46:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-10-14 02:46:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 579. [2024-10-14 02:46:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 447 states have (on average 1.680089485458613) internal successors, (751), 468 states have internal predecessors, (751), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:46:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 956 transitions. [2024-10-14 02:46:43,637 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 956 transitions. Word has length 56 [2024-10-14 02:46:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:43,637 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 956 transitions. [2024-10-14 02:46:43,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 956 transitions. [2024-10-14 02:46:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 02:46:43,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:43,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:43,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:46:43,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:43,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1654320193, now seen corresponding path program 1 times [2024-10-14 02:46:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:43,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105405294] [2024-10-14 02:46:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:46:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:46:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:44,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:44,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:46:44,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:44,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105405294] [2024-10-14 02:46:44,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105405294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:44,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:44,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:46:44,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087648024] [2024-10-14 02:46:44,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:44,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:46:44,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:44,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:46:44,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:46:44,133 INFO L87 Difference]: Start difference. First operand 579 states and 956 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:47,648 INFO L93 Difference]: Finished difference Result 1274 states and 2131 transitions. [2024-10-14 02:46:47,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:46:47,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-10-14 02:46:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:47,654 INFO L225 Difference]: With dead ends: 1274 [2024-10-14 02:46:47,654 INFO L226 Difference]: Without dead ends: 747 [2024-10-14 02:46:47,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:46:47,657 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1243 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2710 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:47,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 1078 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2710 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 02:46:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-10-14 02:46:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 579. [2024-10-14 02:46:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 447 states have (on average 1.6689038031319912) internal successors, (746), 468 states have internal predecessors, (746), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:46:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 951 transitions. [2024-10-14 02:46:47,775 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 951 transitions. Word has length 57 [2024-10-14 02:46:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:47,776 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 951 transitions. [2024-10-14 02:46:47,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 951 transitions. [2024-10-14 02:46:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:46:47,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:47,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:47,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:46:47,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:47,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash -18820935, now seen corresponding path program 1 times [2024-10-14 02:46:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666633102] [2024-10-14 02:46:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:47,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:47,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:47,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:47,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:46:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:46:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:48,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:46:48,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:48,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666633102] [2024-10-14 02:46:48,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666633102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:48,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:48,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:46:48,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364401455] [2024-10-14 02:46:48,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:48,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:46:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:48,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:46:48,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:46:48,278 INFO L87 Difference]: Start difference. First operand 579 states and 951 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:51,979 INFO L93 Difference]: Finished difference Result 1274 states and 2126 transitions. [2024-10-14 02:46:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:46:51,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-14 02:46:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:51,985 INFO L225 Difference]: With dead ends: 1274 [2024-10-14 02:46:51,985 INFO L226 Difference]: Without dead ends: 747 [2024-10-14 02:46:51,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:46:51,988 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 773 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 2824 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:51,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1065 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 2824 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 02:46:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-10-14 02:46:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 579. [2024-10-14 02:46:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 447 states have (on average 1.657718120805369) internal successors, (741), 468 states have internal predecessors, (741), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:46:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 946 transitions. [2024-10-14 02:46:52,100 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 946 transitions. Word has length 58 [2024-10-14 02:46:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:52,100 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 946 transitions. [2024-10-14 02:46:52,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 946 transitions. [2024-10-14 02:46:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 02:46:52,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:52,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:52,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:46:52,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2072660263, now seen corresponding path program 1 times [2024-10-14 02:46:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290823368] [2024-10-14 02:46:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:52,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:52,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:52,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:46:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:52,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:46:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:52,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:46:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:52,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290823368] [2024-10-14 02:46:52,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290823368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:52,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:52,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:46:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031770255] [2024-10-14 02:46:52,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:46:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:52,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:46:52,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:46:52,609 INFO L87 Difference]: Start difference. First operand 579 states and 946 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:56,450 INFO L93 Difference]: Finished difference Result 1262 states and 2101 transitions. [2024-10-14 02:46:56,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:46:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-14 02:46:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:56,455 INFO L225 Difference]: With dead ends: 1262 [2024-10-14 02:46:56,455 INFO L226 Difference]: Without dead ends: 741 [2024-10-14 02:46:56,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:46:56,457 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 762 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:56,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1045 Invalid, 2910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 02:46:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-10-14 02:46:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 581. [2024-10-14 02:46:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 449 states have (on average 1.6547884187082404) internal successors, (743), 470 states have internal predecessors, (743), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:46:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 948 transitions. [2024-10-14 02:46:56,550 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 948 transitions. Word has length 59 [2024-10-14 02:46:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:56,550 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 948 transitions. [2024-10-14 02:46:56,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:46:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 948 transitions. [2024-10-14 02:46:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 02:46:56,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:56,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:56,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:46:56,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:56,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:56,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1283866086, now seen corresponding path program 1 times [2024-10-14 02:46:56,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:56,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493426534] [2024-10-14 02:46:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:56,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:56,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:46:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:46:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:57,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:46:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:46:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:57,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493426534] [2024-10-14 02:46:57,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493426534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:57,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:57,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:46:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473771707] [2024-10-14 02:46:57,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:57,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:46:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:57,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:46:57,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:46:57,105 INFO L87 Difference]: Start difference. First operand 581 states and 948 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:47:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:00,487 INFO L93 Difference]: Finished difference Result 1280 states and 2126 transitions. [2024-10-14 02:47:00,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:47:00,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-14 02:47:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:00,491 INFO L225 Difference]: With dead ends: 1280 [2024-10-14 02:47:00,491 INFO L226 Difference]: Without dead ends: 751 [2024-10-14 02:47:00,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:47:00,493 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1239 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 2951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:00,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 1073 Invalid, 2951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:47:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-10-14 02:47:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 581. [2024-10-14 02:47:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 449 states have (on average 1.643652561247216) internal successors, (738), 470 states have internal predecessors, (738), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:47:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 943 transitions. [2024-10-14 02:47:00,591 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 943 transitions. Word has length 59 [2024-10-14 02:47:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:00,591 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 943 transitions. [2024-10-14 02:47:00,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:47:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 943 transitions. [2024-10-14 02:47:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 02:47:00,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:00,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:00,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:47:00,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:00,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:00,593 INFO L85 PathProgramCache]: Analyzing trace with hash 720858327, now seen corresponding path program 1 times [2024-10-14 02:47:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:00,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987627428] [2024-10-14 02:47:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:00,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:00,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:00,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:00,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:47:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:01,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:47:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:01,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:01,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:47:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:47:01,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987627428] [2024-10-14 02:47:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987627428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:01,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:01,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:47:01,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640092334] [2024-10-14 02:47:01,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:01,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:47:01,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:01,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:47:01,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:47:01,143 INFO L87 Difference]: Start difference. First operand 581 states and 943 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:47:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:06,291 INFO L93 Difference]: Finished difference Result 1276 states and 2113 transitions. [2024-10-14 02:47:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:47:06,292 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2024-10-14 02:47:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:06,296 INFO L225 Difference]: With dead ends: 1276 [2024-10-14 02:47:06,297 INFO L226 Difference]: Without dead ends: 755 [2024-10-14 02:47:06,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:47:06,299 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 1231 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 4983 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 5272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 4983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:06,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1872 Invalid, 5272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 4983 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 02:47:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-14 02:47:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 584. [2024-10-14 02:47:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 452 states have (on average 1.6393805309734513) internal successors, (741), 473 states have internal predecessors, (741), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:47:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 946 transitions. [2024-10-14 02:47:06,397 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 946 transitions. Word has length 60 [2024-10-14 02:47:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:06,397 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 946 transitions. [2024-10-14 02:47:06,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:47:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 946 transitions. [2024-10-14 02:47:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 02:47:06,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:06,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:06,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:47:06,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:06,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2023492596, now seen corresponding path program 1 times [2024-10-14 02:47:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266723722] [2024-10-14 02:47:06,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:06,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:06,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:47:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:47:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:06,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:06,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:06,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:47:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:47:06,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:06,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266723722] [2024-10-14 02:47:06,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266723722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:06,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:06,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:47:06,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274348088] [2024-10-14 02:47:06,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:06,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:47:06,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:06,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:47:06,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:47:06,943 INFO L87 Difference]: Start difference. First operand 584 states and 946 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:47:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:10,371 INFO L93 Difference]: Finished difference Result 1289 states and 2129 transitions. [2024-10-14 02:47:10,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:47:10,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-14 02:47:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:10,376 INFO L225 Difference]: With dead ends: 1289 [2024-10-14 02:47:10,376 INFO L226 Difference]: Without dead ends: 757 [2024-10-14 02:47:10,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:47:10,378 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1240 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2650 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:10,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1058 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2650 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:47:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-10-14 02:47:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 584. [2024-10-14 02:47:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 452 states have (on average 1.6283185840707965) internal successors, (736), 473 states have internal predecessors, (736), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:47:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 941 transitions. [2024-10-14 02:47:10,477 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 941 transitions. Word has length 60 [2024-10-14 02:47:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:10,477 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 941 transitions. [2024-10-14 02:47:10,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:47:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 941 transitions. [2024-10-14 02:47:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 02:47:10,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:10,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:47:10,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:10,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1712811916, now seen corresponding path program 1 times [2024-10-14 02:47:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:10,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843122197] [2024-10-14 02:47:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:47:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:11,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:47:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:11,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:47:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:47:11,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:11,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843122197] [2024-10-14 02:47:11,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843122197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:11,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:11,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:47:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156451727] [2024-10-14 02:47:11,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:11,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:47:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:11,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:47:11,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:47:11,038 INFO L87 Difference]: Start difference. First operand 584 states and 941 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:47:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:16,244 INFO L93 Difference]: Finished difference Result 1284 states and 2116 transitions. [2024-10-14 02:47:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:47:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2024-10-14 02:47:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:16,249 INFO L225 Difference]: With dead ends: 1284 [2024-10-14 02:47:16,249 INFO L226 Difference]: Without dead ends: 763 [2024-10-14 02:47:16,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:47:16,252 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 753 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 5089 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 5220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 5089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:16,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 1878 Invalid, 5220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 5089 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-14 02:47:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-10-14 02:47:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 588. [2024-10-14 02:47:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 456 states have (on average 1.6228070175438596) internal successors, (740), 477 states have internal predecessors, (740), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:47:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 945 transitions. [2024-10-14 02:47:16,380 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 945 transitions. Word has length 61 [2024-10-14 02:47:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:16,381 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 945 transitions. [2024-10-14 02:47:16,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:47:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 945 transitions. [2024-10-14 02:47:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 02:47:16,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:16,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:16,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:47:16,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:16,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1046482037, now seen corresponding path program 1 times [2024-10-14 02:47:16,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:16,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450474624] [2024-10-14 02:47:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:16,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:47:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:16,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:47:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:16,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:16,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:16,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:47:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:47:16,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:16,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450474624] [2024-10-14 02:47:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450474624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:16,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:16,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:47:16,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333195573] [2024-10-14 02:47:16,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:47:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:16,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:47:16,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:47:16,855 INFO L87 Difference]: Start difference. First operand 588 states and 945 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:47:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:20,403 INFO L93 Difference]: Finished difference Result 1331 states and 2173 transitions. [2024-10-14 02:47:20,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:47:20,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-14 02:47:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:20,408 INFO L225 Difference]: With dead ends: 1331 [2024-10-14 02:47:20,408 INFO L226 Difference]: Without dead ends: 755 [2024-10-14 02:47:20,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:47:20,410 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1178 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 2643 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 2925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:20,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1051 Invalid, 2925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2643 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 02:47:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-14 02:47:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 588. [2024-10-14 02:47:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 456 states have (on average 1.6206140350877194) internal successors, (739), 477 states have internal predecessors, (739), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:47:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 944 transitions. [2024-10-14 02:47:20,491 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 944 transitions. Word has length 61 [2024-10-14 02:47:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:20,491 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 944 transitions. [2024-10-14 02:47:20,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:47:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 944 transitions. [2024-10-14 02:47:20,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 02:47:20,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:20,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:20,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:47:20,493 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:20,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:20,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1287022166, now seen corresponding path program 1 times [2024-10-14 02:47:20,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:20,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32356715] [2024-10-14 02:47:20,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:20,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:20,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:20,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:47:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:21,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:47:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:21,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:47:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:47:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:21,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32356715] [2024-10-14 02:47:21,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32356715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:21,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:21,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:47:21,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666402516] [2024-10-14 02:47:21,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:21,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:47:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:21,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:47:21,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:47:21,043 INFO L87 Difference]: Start difference. First operand 588 states and 944 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:47:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:26,401 INFO L93 Difference]: Finished difference Result 1286 states and 2116 transitions. [2024-10-14 02:47:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:47:26,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2024-10-14 02:47:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:26,407 INFO L225 Difference]: With dead ends: 1286 [2024-10-14 02:47:26,407 INFO L226 Difference]: Without dead ends: 745 [2024-10-14 02:47:26,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:47:26,409 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 765 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 5090 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 5215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 5090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:26,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1931 Invalid, 5215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 5090 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-14 02:47:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-10-14 02:47:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 580. [2024-10-14 02:47:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 448 states have (on average 1.625) internal successors, (728), 469 states have internal predecessors, (728), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:47:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 933 transitions. [2024-10-14 02:47:26,513 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 933 transitions. Word has length 61 [2024-10-14 02:47:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:26,513 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 933 transitions. [2024-10-14 02:47:26,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:47:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 933 transitions. [2024-10-14 02:47:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 02:47:26,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:26,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:26,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 02:47:26,515 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:26,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 181197969, now seen corresponding path program 1 times [2024-10-14 02:47:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056585170] [2024-10-14 02:47:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:26,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:26,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:26,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:47:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:26,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:47:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:26,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:27,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:47:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:47:27,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:27,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056585170] [2024-10-14 02:47:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056585170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:27,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:27,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:47:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070456413] [2024-10-14 02:47:27,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:27,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:47:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:47:27,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:47:27,006 INFO L87 Difference]: Start difference. First operand 580 states and 933 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:47:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:30,549 INFO L93 Difference]: Finished difference Result 1276 states and 2100 transitions. [2024-10-14 02:47:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:47:30,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2024-10-14 02:47:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:30,553 INFO L225 Difference]: With dead ends: 1276 [2024-10-14 02:47:30,553 INFO L226 Difference]: Without dead ends: 755 [2024-10-14 02:47:30,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:47:30,555 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 1196 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 2605 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:30,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 1032 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2605 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 02:47:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-14 02:47:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 585. [2024-10-14 02:47:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 453 states have (on average 1.6181015452538632) internal successors, (733), 474 states have internal predecessors, (733), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 02:47:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 938 transitions. [2024-10-14 02:47:30,659 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 938 transitions. Word has length 62 [2024-10-14 02:47:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:30,659 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 938 transitions. [2024-10-14 02:47:30,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:47:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 938 transitions. [2024-10-14 02:47:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 02:47:30,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:30,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:30,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 02:47:30,660 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:30,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 874418722, now seen corresponding path program 1 times [2024-10-14 02:47:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264054774] [2024-10-14 02:47:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:47:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:47:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:31,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:31,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:47:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:47:31,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:31,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264054774] [2024-10-14 02:47:31,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264054774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:31,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:31,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:47:31,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199008981] [2024-10-14 02:47:31,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:31,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:47:31,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:31,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:47:31,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:47:31,089 INFO L87 Difference]: Start difference. First operand 585 states and 938 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)