./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_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8090ac1e7e8284dad30217492085f9e11f6491349a4adb4aa3c2904a72e0131a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:35:15,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:35:15,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:35:15,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:35:15,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:35:15,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:35:15,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:35:15,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:35:15,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:35:15,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:35:15,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:35:15,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:35:15,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:35:15,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:35:15,514 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:35:15,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:35:15,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:35:15,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:35:15,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:35:15,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:35:15,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:35:15,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:35:15,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:35:15,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:35:15,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:35:15,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:35:15,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:35:15,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:35:15,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:35:15,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:35:15,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:35:15,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:35:15,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:35:15,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:35:15,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:35:15,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:35:15,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:35:15,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:35:15,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:35:15,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:35:15,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:35:15,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:35:15,521 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-clean/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-clean/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 -> 8090ac1e7e8284dad30217492085f9e11f6491349a4adb4aa3c2904a72e0131a [2024-10-11 02:35:15,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:35:15,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:35:15,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:35:15,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:35:15,801 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:35:15,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c [2024-10-11 02:35:17,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:35:17,511 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:35:17,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c [2024-10-11 02:35:17,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/512e1a2ab/d75c53e1c7414d17b4bd3a92a88cea15/FLAG67a8a70fb [2024-10-11 02:35:17,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/512e1a2ab/d75c53e1c7414d17b4bd3a92a88cea15 [2024-10-11 02:35:17,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:35:17,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:35:17,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:35:17,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:35:17,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:35:17,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:35:17" (1/1) ... [2024-10-11 02:35:17,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c6dd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:17, skipping insertion in model container [2024-10-11 02:35:17,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:35:17" (1/1) ... [2024-10-11 02:35:17,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:35:17,848 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_product22.cil.c[1545,1558] [2024-10-11 02:35:18,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:35:18,100 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:35:18,107 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2024-10-11 02:35:18,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [57] [2024-10-11 02:35:18,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [421] [2024-10-11 02:35:18,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1088] [2024-10-11 02:35:18,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1454] [2024-10-11 02:35:18,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1466] [2024-10-11 02:35:18,110 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1586] [2024-10-11 02:35:18,110 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1621] [2024-10-11 02:35:18,110 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3188] [2024-10-11 02:35:18,110 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3279] [2024-10-11 02:35:18,114 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_product22.cil.c[1545,1558] [2024-10-11 02:35:18,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:35:18,204 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:35:18,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18 WrapperNode [2024-10-11 02:35:18,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:35:18,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:35:18,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:35:18,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:35:18,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,274 INFO L138 Inliner]: procedures = 94, calls = 345, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 875 [2024-10-11 02:35:18,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:35:18,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:35:18,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:35:18,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:35:18,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,333 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-11 02:35:18,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:35:18,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:35:18,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:35:18,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:35:18,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (1/1) ... [2024-10-11 02:35:18,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:35:18,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:35:18,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:35:18,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:35:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:35:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:35:18,484 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:35:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:35:18,484 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:35:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:35:18,484 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:35:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:35:18,485 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:35:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:35:18,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:35:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:35:18,485 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:35:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:35:18,485 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:35:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:35:18,485 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:35:18,485 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:35:18,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:35:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:35:18,486 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:35:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:35:18,486 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:35:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:35:18,486 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:35:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:35:18,486 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:35:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:35:18,487 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:35:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:35:18,487 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:35:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:35:18,487 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:35:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:35:18,487 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:35:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:35:18,488 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:35:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:35:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:35:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:35:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:35:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:35:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:35:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:35:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:35:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:35:18,489 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:35:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:35:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:35:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:35:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:35:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:35:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:35:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2024-10-11 02:35:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2024-10-11 02:35:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:35:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:35:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:35:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:35:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:35:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:35:18,675 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:35:18,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:35:19,571 INFO L? ?]: Removed 450 outVars from TransFormulas that were not future-live. [2024-10-11 02:35:19,572 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:35:19,651 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:35:19,654 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:35:19,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:35:19 BoogieIcfgContainer [2024-10-11 02:35:19,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:35:19,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:35:19,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:35:19,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:35:19,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:35:17" (1/3) ... [2024-10-11 02:35:19,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ee5b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:35:19, skipping insertion in model container [2024-10-11 02:35:19,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:18" (2/3) ... [2024-10-11 02:35:19,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ee5b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:35:19, skipping insertion in model container [2024-10-11 02:35:19,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:35:19" (3/3) ... [2024-10-11 02:35:19,666 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product22.cil.c [2024-10-11 02:35:19,678 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:35:19,679 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:35:19,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:35:19,758 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;@5393f59f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:35:19,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:35:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 551 states, 426 states have (on average 1.7253521126760563) internal successors, (735), 449 states have internal predecessors, (735), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:35:19,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 02:35:19,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:19,779 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-11 02:35:19,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:19,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash -749855397, now seen corresponding path program 1 times [2024-10-11 02:35:19,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:19,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989875166] [2024-10-11 02:35:19,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:19,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:35:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:35:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,870 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-11 02:35:20,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:20,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989875166] [2024-10-11 02:35:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989875166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:20,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072872345] [2024-10-11 02:35:20,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:20,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:20,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:20,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:20,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:20,896 INFO L87 Difference]: Start difference. First operand has 551 states, 426 states have (on average 1.7253521126760563) internal successors, (735), 449 states have internal predecessors, (735), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) 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-11 02:35:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:25,626 INFO L93 Difference]: Finished difference Result 1247 states and 2133 transitions. [2024-10-11 02:35:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:35:25,629 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-11 02:35:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:25,645 INFO L225 Difference]: With dead ends: 1247 [2024-10-11 02:35:25,645 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 02:35:25,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:35:25,655 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 683 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 2780 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:25,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1086 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2780 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 02:35:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 02:35:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 547. [2024-10-11 02:35:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.7146226415094339) internal successors, (727), 445 states have internal predecessors, (727), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 02:35:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 918 transitions. [2024-10-11 02:35:25,827 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 918 transitions. Word has length 50 [2024-10-11 02:35:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:25,828 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 918 transitions. [2024-10-11 02:35:25,828 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-11 02:35:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 918 transitions. [2024-10-11 02:35:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 02:35:25,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:25,831 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-11 02:35:25,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:35:25,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:25,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -597670318, now seen corresponding path program 1 times [2024-10-11 02:35:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:25,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379356986] [2024-10-11 02:35:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:26,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:26,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:26,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:26,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:35:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:26,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:26,329 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-11 02:35:26,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:26,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379356986] [2024-10-11 02:35:26,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379356986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:26,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:26,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:26,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108812929] [2024-10-11 02:35:26,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:26,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:26,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:26,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:26,332 INFO L87 Difference]: Start difference. First operand 547 states and 918 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-11 02:35:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:30,148 INFO L93 Difference]: Finished difference Result 1240 states and 2106 transitions. [2024-10-11 02:35:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:35:30,148 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-11 02:35:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:30,158 INFO L225 Difference]: With dead ends: 1240 [2024-10-11 02:35:30,160 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 02:35:30,166 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-11 02:35:30,168 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 681 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 2759 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:30,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1071 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2759 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:35:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 02:35:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 547. [2024-10-11 02:35:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.7122641509433962) internal successors, (726), 445 states have internal predecessors, (726), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 02:35:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 917 transitions. [2024-10-11 02:35:30,265 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 917 transitions. Word has length 52 [2024-10-11 02:35:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:30,266 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 917 transitions. [2024-10-11 02:35:30,266 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-11 02:35:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 917 transitions. [2024-10-11 02:35:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 02:35:30,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:30,270 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-11 02:35:30,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:35:30,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:30,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash 989901967, now seen corresponding path program 1 times [2024-10-11 02:35:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:30,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599101273] [2024-10-11 02:35:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:35:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:35:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,919 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-11 02:35:30,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:30,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599101273] [2024-10-11 02:35:30,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599101273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:30,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:30,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:30,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580255970] [2024-10-11 02:35:30,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:30,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:30,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:30,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:30,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:30,924 INFO L87 Difference]: Start difference. First operand 547 states and 917 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-11 02:35:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:34,823 INFO L93 Difference]: Finished difference Result 1240 states and 2105 transitions. [2024-10-11 02:35:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:35:34,824 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-11 02:35:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:34,828 INFO L225 Difference]: With dead ends: 1240 [2024-10-11 02:35:34,828 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 02:35:34,830 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-11 02:35:34,831 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1131 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:34,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 1069 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:35:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 02:35:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 547. [2024-10-11 02:35:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.7099056603773586) internal successors, (725), 445 states have internal predecessors, (725), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 02:35:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 916 transitions. [2024-10-11 02:35:34,892 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 916 transitions. Word has length 53 [2024-10-11 02:35:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:34,892 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 916 transitions. [2024-10-11 02:35:34,892 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-11 02:35:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 916 transitions. [2024-10-11 02:35:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:35:34,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:34,893 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-11 02:35:34,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:35:34,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:34,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash 452007926, now seen corresponding path program 1 times [2024-10-11 02:35:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:34,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738476564] [2024-10-11 02:35:34,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:34,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:35:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:35:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,383 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-11 02:35:35,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:35,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738476564] [2024-10-11 02:35:35,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738476564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:35,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:35,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:35,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393821485] [2024-10-11 02:35:35,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:35,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:35,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:35,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:35,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:35,386 INFO L87 Difference]: Start difference. First operand 547 states and 916 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-11 02:35:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:38,991 INFO L93 Difference]: Finished difference Result 1240 states and 2104 transitions. [2024-10-11 02:35:38,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:35:38,991 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-11 02:35:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:38,995 INFO L225 Difference]: With dead ends: 1240 [2024-10-11 02:35:38,996 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 02:35:38,998 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-11 02:35:38,998 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1129 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:38,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 1063 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2599 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:35:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 02:35:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 547. [2024-10-11 02:35:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.7075471698113207) internal successors, (724), 445 states have internal predecessors, (724), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 02:35:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 915 transitions. [2024-10-11 02:35:39,092 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 915 transitions. Word has length 54 [2024-10-11 02:35:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:39,092 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 915 transitions. [2024-10-11 02:35:39,092 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-11 02:35:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 915 transitions. [2024-10-11 02:35:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 02:35:39,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:39,095 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-11 02:35:39,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:35:39,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:39,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:39,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1550832781, now seen corresponding path program 1 times [2024-10-11 02:35:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961137549] [2024-10-11 02:35:39,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:39,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:35:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,617 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-11 02:35:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961137549] [2024-10-11 02:35:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961137549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:39,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:39,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59804013] [2024-10-11 02:35:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:39,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:39,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:39,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:39,621 INFO L87 Difference]: Start difference. First operand 547 states and 915 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-11 02:35:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:43,183 INFO L93 Difference]: Finished difference Result 1240 states and 2103 transitions. [2024-10-11 02:35:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:35:43,184 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-11 02:35:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:43,188 INFO L225 Difference]: With dead ends: 1240 [2024-10-11 02:35:43,188 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 02:35:43,190 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-11 02:35:43,190 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1128 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:43,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1054 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:35:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 02:35:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 547. [2024-10-11 02:35:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.705188679245283) internal successors, (723), 445 states have internal predecessors, (723), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 02:35:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 914 transitions. [2024-10-11 02:35:43,276 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 914 transitions. Word has length 55 [2024-10-11 02:35:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:43,276 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 914 transitions. [2024-10-11 02:35:43,276 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-11 02:35:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 914 transitions. [2024-10-11 02:35:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:35:43,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:43,277 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-11 02:35:43,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:35:43,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:43,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:43,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1722379878, now seen corresponding path program 1 times [2024-10-11 02:35:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:43,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311337259] [2024-10-11 02:35:43,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:43,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:35:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,839 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-11 02:35:43,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311337259] [2024-10-11 02:35:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311337259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:43,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:43,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:43,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733321736] [2024-10-11 02:35:43,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:43,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:43,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:43,843 INFO L87 Difference]: Start difference. First operand 547 states and 914 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-11 02:35:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:47,488 INFO L93 Difference]: Finished difference Result 1210 states and 2042 transitions. [2024-10-11 02:35:47,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:35:47,489 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-11 02:35:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:47,493 INFO L225 Difference]: With dead ends: 1210 [2024-10-11 02:35:47,493 INFO L226 Difference]: Without dead ends: 715 [2024-10-11 02:35:47,494 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-11 02:35:47,495 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 735 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:47,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1050 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:35:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-11 02:35:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 547. [2024-10-11 02:35:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 424 states have (on average 1.6933962264150944) internal successors, (718), 445 states have internal predecessors, (718), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 02:35:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 909 transitions. [2024-10-11 02:35:47,552 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 909 transitions. Word has length 56 [2024-10-11 02:35:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:47,552 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 909 transitions. [2024-10-11 02:35:47,552 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-11 02:35:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 909 transitions. [2024-10-11 02:35:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:35:47,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:47,553 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-11 02:35:47,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:35:47,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:47,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1061510395, now seen corresponding path program 1 times [2024-10-11 02:35:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:47,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729194632] [2024-10-11 02:35:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:47,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:35:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:48,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:48,078 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-11 02:35:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729194632] [2024-10-11 02:35:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729194632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:48,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:35:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575645606] [2024-10-11 02:35:48,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:48,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:35:48,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:48,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:35:48,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:35:48,080 INFO L87 Difference]: Start difference. First operand 547 states and 909 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 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-11 02:35:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:54,687 INFO L93 Difference]: Finished difference Result 1232 states and 2075 transitions. [2024-10-11 02:35:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 02:35:54,688 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 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 57 [2024-10-11 02:35:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:54,692 INFO L225 Difference]: With dead ends: 1232 [2024-10-11 02:35:54,693 INFO L226 Difference]: Without dead ends: 745 [2024-10-11 02:35:54,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2024-10-11 02:35:54,695 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 823 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 6422 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 6552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 6422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:54,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 2525 Invalid, 6552 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [130 Valid, 6422 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 02:35:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-10-11 02:35:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 559. [2024-10-11 02:35:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 433 states have (on average 1.6905311778290992) internal successors, (732), 456 states have internal predecessors, (732), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2024-10-11 02:35:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 927 transitions. [2024-10-11 02:35:54,758 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 927 transitions. Word has length 57 [2024-10-11 02:35:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:54,759 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 927 transitions. [2024-10-11 02:35:54,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 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-11 02:35:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 927 transitions. [2024-10-11 02:35:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:35:54,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:54,761 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-11 02:35:54,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:35:54,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:54,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash -121836902, now seen corresponding path program 1 times [2024-10-11 02:35:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169180118] [2024-10-11 02:35:54,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:54,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:54,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:55,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:35:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:55,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:55,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:55,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:55,206 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-11 02:35:55,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:55,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169180118] [2024-10-11 02:35:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169180118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:55,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:55,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:55,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671652532] [2024-10-11 02:35:55,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:55,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:55,207 INFO L87 Difference]: Start difference. First operand 559 states and 927 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-11 02:35:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:58,445 INFO L93 Difference]: Finished difference Result 1238 states and 2083 transitions. [2024-10-11 02:35:58,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:35:58,445 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-11 02:35:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:58,449 INFO L225 Difference]: With dead ends: 1238 [2024-10-11 02:35:58,450 INFO L226 Difference]: Without dead ends: 735 [2024-10-11 02:35:58,451 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-11 02:35:58,452 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1186 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:58,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 1084 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:35:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-11 02:35:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 559. [2024-10-11 02:35:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 433 states have (on average 1.6789838337182448) internal successors, (727), 456 states have internal predecessors, (727), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2024-10-11 02:35:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 922 transitions. [2024-10-11 02:35:58,537 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 922 transitions. Word has length 57 [2024-10-11 02:35:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:58,538 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 922 transitions. [2024-10-11 02:35:58,538 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-11 02:35:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 922 transitions. [2024-10-11 02:35:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:35:58,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:58,539 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-11 02:35:58,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:35:58,540 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:58,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1287179498, now seen corresponding path program 1 times [2024-10-11 02:35:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:58,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721962775] [2024-10-11 02:35:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:58,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:35:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,977 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-11 02:35:58,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:58,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721962775] [2024-10-11 02:35:58,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721962775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:58,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:58,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:58,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316740806] [2024-10-11 02:35:58,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:58,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:58,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:58,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:58,983 INFO L87 Difference]: Start difference. First operand 559 states and 922 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-11 02:36:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:02,109 INFO L93 Difference]: Finished difference Result 1238 states and 2078 transitions. [2024-10-11 02:36:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:02,110 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-11 02:36:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:02,113 INFO L225 Difference]: With dead ends: 1238 [2024-10-11 02:36:02,113 INFO L226 Difference]: Without dead ends: 735 [2024-10-11 02:36:02,115 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-11 02:36:02,115 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1185 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:02,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1084 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 02:36:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-11 02:36:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 559. [2024-10-11 02:36:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 433 states have (on average 1.6674364896073903) internal successors, (722), 456 states have internal predecessors, (722), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2024-10-11 02:36:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 917 transitions. [2024-10-11 02:36:02,191 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 917 transitions. Word has length 58 [2024-10-11 02:36:02,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:02,192 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 917 transitions. [2024-10-11 02:36:02,192 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-11 02:36:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 917 transitions. [2024-10-11 02:36:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:36:02,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:02,195 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-11 02:36:02,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:36:02,195 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:02,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash 815991093, now seen corresponding path program 1 times [2024-10-11 02:36:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:02,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166730765] [2024-10-11 02:36:02,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:02,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:02,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:02,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:02,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:02,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:02,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:02,611 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-11 02:36:02,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:02,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166730765] [2024-10-11 02:36:02,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166730765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:02,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:02,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:02,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638705560] [2024-10-11 02:36:02,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:02,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:02,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:02,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:02,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:02,613 INFO L87 Difference]: Start difference. First operand 559 states and 917 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-11 02:36:06,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:06,455 INFO L93 Difference]: Finished difference Result 1238 states and 2073 transitions. [2024-10-11 02:36:06,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:06,456 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-11 02:36:06,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:06,460 INFO L225 Difference]: With dead ends: 1238 [2024-10-11 02:36:06,460 INFO L226 Difference]: Without dead ends: 735 [2024-10-11 02:36:06,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:06,462 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 732 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:06,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1065 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2646 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 02:36:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-11 02:36:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 559. [2024-10-11 02:36:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 433 states have (on average 1.6558891454965359) internal successors, (717), 456 states have internal predecessors, (717), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2024-10-11 02:36:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 912 transitions. [2024-10-11 02:36:06,525 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 912 transitions. Word has length 59 [2024-10-11 02:36:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:06,525 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 912 transitions. [2024-10-11 02:36:06,525 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-11 02:36:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 912 transitions. [2024-10-11 02:36:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:36:06,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:06,526 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-11 02:36:06,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:36:06,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:06,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:06,527 INFO L85 PathProgramCache]: Analyzing trace with hash 27196916, now seen corresponding path program 1 times [2024-10-11 02:36:06,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:06,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487983962] [2024-10-11 02:36:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:06,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,984 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-11 02:36:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487983962] [2024-10-11 02:36:06,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487983962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:06,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:06,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941503641] [2024-10-11 02:36:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:06,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:06,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:06,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:06,986 INFO L87 Difference]: Start difference. First operand 559 states and 912 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-11 02:36:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:11,747 INFO L93 Difference]: Finished difference Result 1224 states and 2041 transitions. [2024-10-11 02:36:11,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:36:11,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2024-10-11 02:36:11,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:11,752 INFO L225 Difference]: With dead ends: 1224 [2024-10-11 02:36:11,753 INFO L226 Difference]: Without dead ends: 733 [2024-10-11 02:36:11,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:36:11,760 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 719 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 4831 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 4956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 4831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:11,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1906 Invalid, 4956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 4831 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 02:36:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-11 02:36:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 561. [2024-10-11 02:36:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 435 states have (on average 1.650574712643678) internal successors, (718), 458 states have internal predecessors, (718), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2024-10-11 02:36:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 913 transitions. [2024-10-11 02:36:11,836 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 913 transitions. Word has length 59 [2024-10-11 02:36:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:11,837 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 913 transitions. [2024-10-11 02:36:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-11 02:36:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 913 transitions. [2024-10-11 02:36:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:36:11,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:11,838 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-11 02:36:11,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:36:11,838 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:11,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:11,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1163855377, now seen corresponding path program 1 times [2024-10-11 02:36:11,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:11,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106031940] [2024-10-11 02:36:11,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:11,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:11,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:36:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,260 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-11 02:36:12,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:12,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106031940] [2024-10-11 02:36:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106031940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:12,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:12,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:12,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26740960] [2024-10-11 02:36:12,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:12,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:12,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:12,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:12,262 INFO L87 Difference]: Start difference. First operand 561 states and 913 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-11 02:36:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:15,552 INFO L93 Difference]: Finished difference Result 1244 states and 2070 transitions. [2024-10-11 02:36:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:15,552 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-11 02:36:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:15,557 INFO L225 Difference]: With dead ends: 1244 [2024-10-11 02:36:15,557 INFO L226 Difference]: Without dead ends: 739 [2024-10-11 02:36:15,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:15,560 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1187 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:15,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1043 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:36:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-10-11 02:36:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 561. [2024-10-11 02:36:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 435 states have (on average 1.639080459770115) internal successors, (713), 458 states have internal predecessors, (713), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2024-10-11 02:36:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 908 transitions. [2024-10-11 02:36:15,656 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 908 transitions. Word has length 60 [2024-10-11 02:36:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:15,657 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 908 transitions. [2024-10-11 02:36:15,657 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-11 02:36:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 908 transitions. [2024-10-11 02:36:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:36:15,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:15,658 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-11 02:36:15,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:36:15,658 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:15,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash -138778892, now seen corresponding path program 1 times [2024-10-11 02:36:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730013169] [2024-10-11 02:36:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:15,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:15,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:36:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,086 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-11 02:36:16,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:16,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730013169] [2024-10-11 02:36:16,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730013169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:16,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:16,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:16,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514092308] [2024-10-11 02:36:16,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:16,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:16,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:16,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:16,089 INFO L87 Difference]: Start difference. First operand 561 states and 908 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-11 02:36:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:21,209 INFO L93 Difference]: Finished difference Result 1222 states and 2029 transitions. [2024-10-11 02:36:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:36:21,210 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-11 02:36:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:21,213 INFO L225 Difference]: With dead ends: 1222 [2024-10-11 02:36:21,214 INFO L226 Difference]: Without dead ends: 733 [2024-10-11 02:36:21,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:36:21,215 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 714 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 4797 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 4924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 4797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:21,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1904 Invalid, 4924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 4797 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 02:36:21,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-11 02:36:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 561. [2024-10-11 02:36:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 435 states have (on average 1.6367816091954024) internal successors, (712), 458 states have internal predecessors, (712), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2024-10-11 02:36:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 907 transitions. [2024-10-11 02:36:21,280 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 907 transitions. Word has length 60 [2024-10-11 02:36:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:21,280 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 907 transitions. [2024-10-11 02:36:21,280 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-11 02:36:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 907 transitions. [2024-10-11 02:36:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:36:21,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:21,281 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-11 02:36:21,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:36:21,281 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:21,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:21,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1363168304, now seen corresponding path program 1 times [2024-10-11 02:36:21,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:21,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871028806] [2024-10-11 02:36:21,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:21,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:21,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:21,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:21,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:36:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:21,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:21,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:21,662 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-11 02:36:21,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:21,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871028806] [2024-10-11 02:36:21,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871028806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:21,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:21,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:21,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173216881] [2024-10-11 02:36:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:21,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:21,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:21,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:21,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:21,664 INFO L87 Difference]: Start difference. First operand 561 states and 907 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-11 02:36:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:25,031 INFO L93 Difference]: Finished difference Result 1270 states and 2089 transitions. [2024-10-11 02:36:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:36:25,032 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-11 02:36:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:25,036 INFO L225 Difference]: With dead ends: 1270 [2024-10-11 02:36:25,036 INFO L226 Difference]: Without dead ends: 678 [2024-10-11 02:36:25,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:25,038 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 1124 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:25,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 1021 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:36:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-10-11 02:36:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 520. [2024-10-11 02:36:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 397 states have (on average 1.6624685138539044) internal successors, (660), 418 states have internal predecessors, (660), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 02:36:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 851 transitions. [2024-10-11 02:36:25,100 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 851 transitions. Word has length 61 [2024-10-11 02:36:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:25,100 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 851 transitions. [2024-10-11 02:36:25,100 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-11 02:36:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 851 transitions. [2024-10-11 02:36:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 02:36:25,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:25,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, 1, 1, 1, 1] [2024-10-11 02:36:25,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:36:25,102 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:25,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash 295410491, now seen corresponding path program 1 times [2024-10-11 02:36:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189831644] [2024-10-11 02:36:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:25,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:25,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:25,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:36:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:25,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:25,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:25,791 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-11 02:36:25,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:25,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189831644] [2024-10-11 02:36:25,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189831644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:25,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:25,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:36:25,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523255469] [2024-10-11 02:36:25,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:25,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:36:25,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:25,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:36:25,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:25,793 INFO L87 Difference]: Start difference. First operand 520 states and 851 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 02:36:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:32,527 INFO L93 Difference]: Finished difference Result 1978 states and 3373 transitions. [2024-10-11 02:36:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:36:32,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2024-10-11 02:36:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:32,540 INFO L225 Difference]: With dead ends: 1978 [2024-10-11 02:36:32,540 INFO L226 Difference]: Without dead ends: 1496 [2024-10-11 02:36:32,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:36:32,544 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 4220 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 1156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4310 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 4864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1156 IncrementalHoareTripleChecker+Valid, 3708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:32,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4310 Valid, 1598 Invalid, 4864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1156 Valid, 3708 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-11 02:36:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2024-10-11 02:36:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1027. [2024-10-11 02:36:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 792 states have (on average 1.6792929292929293) internal successors, (1330), 822 states have internal predecessors, (1330), 190 states have call successors, (190), 43 states have call predecessors, (190), 44 states have return successors, (192), 174 states have call predecessors, (192), 185 states have call successors, (192) [2024-10-11 02:36:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1712 transitions. [2024-10-11 02:36:32,731 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1712 transitions. Word has length 63 [2024-10-11 02:36:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:32,731 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1712 transitions. [2024-10-11 02:36:32,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 02:36:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1712 transitions. [2024-10-11 02:36:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:36:32,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:32,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:36:32,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:36:32,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:32,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1869620928, now seen corresponding path program 1 times [2024-10-11 02:36:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:32,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267202780] [2024-10-11 02:36:32,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:36:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:36:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:36:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:36:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:36:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:36:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:33,886 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-11 02:36:33,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267202780] [2024-10-11 02:36:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267202780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:33,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:33,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 02:36:33,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353838479] [2024-10-11 02:36:33,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:33,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:36:33,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:33,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:36:33,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:36:33,887 INFO L87 Difference]: Start difference. First operand 1027 states and 1712 transitions. Second operand has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:36:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:43,181 INFO L93 Difference]: Finished difference Result 3013 states and 5173 transitions. [2024-10-11 02:36:43,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 02:36:43,182 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 101 [2024-10-11 02:36:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:43,191 INFO L225 Difference]: With dead ends: 3013 [2024-10-11 02:36:43,191 INFO L226 Difference]: Without dead ends: 2025 [2024-10-11 02:36:43,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2024-10-11 02:36:43,194 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 2888 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 7460 mSolverCounterSat, 1088 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2941 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 8548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1088 IncrementalHoareTripleChecker+Valid, 7460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:43,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2941 Valid, 3183 Invalid, 8548 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1088 Valid, 7460 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-10-11 02:36:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2024-10-11 02:36:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1458. [2024-10-11 02:36:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1112 states have (on average 1.643884892086331) internal successors, (1828), 1146 states have internal predecessors, (1828), 274 states have call successors, (274), 59 states have call predecessors, (274), 71 states have return successors, (320), 263 states have call predecessors, (320), 269 states have call successors, (320) [2024-10-11 02:36:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2422 transitions. [2024-10-11 02:36:43,440 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2422 transitions. Word has length 101 [2024-10-11 02:36:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:43,441 INFO L471 AbstractCegarLoop]: Abstraction has 1458 states and 2422 transitions. [2024-10-11 02:36:43,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:36:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2422 transitions. [2024-10-11 02:36:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 02:36:43,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:43,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:36:43,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:36:43,444 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:43,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1989409722, now seen corresponding path program 1 times [2024-10-11 02:36:43,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:43,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267319064] [2024-10-11 02:36:43,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:43,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:43,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:36:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:36:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:36:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:36:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:36:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:36:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,386 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-11 02:36:44,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:44,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267319064] [2024-10-11 02:36:44,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267319064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:44,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:44,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 02:36:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646952592] [2024-10-11 02:36:44,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:44,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 02:36:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:44,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 02:36:44,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:36:44,388 INFO L87 Difference]: Start difference. First operand 1458 states and 2422 transitions. Second operand has 13 states, 12 states have (on average 6.416666666666667) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12)