./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_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e942074e046d4b6eec963a95d600daf33500a37aba1da700aae37a309fea4cda --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:17:07,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:17:07,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:17:07,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:17:07,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:17:07,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:17:07,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:17:07,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:17:07,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:17:07,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:17:07,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:17:07,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:17:07,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:17:07,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:17:07,559 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:17:07,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:17:07,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:17:07,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:17:07,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:17:07,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:17:07,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:17:07,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:17:07,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:17:07,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:17:07,562 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:17:07,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:17:07,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:17:07,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:17:07,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:17:07,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:17:07,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:17:07,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:17:07,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:17:07,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:17:07,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:17:07,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:17:07,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:17:07,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:17:07,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:17:07,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:17:07,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:17:07,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:17:07,567 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e942074e046d4b6eec963a95d600daf33500a37aba1da700aae37a309fea4cda [2024-10-12 19:17:07,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:17:07,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:17:07,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:17:07,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:17:07,830 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:17:07,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c [2024-10-12 19:17:09,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:17:09,663 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:17:09,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c [2024-10-12 19:17:09,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2119f2375/b9691288d431413eae023c0e7b13e780/FLAG8138ca0c4 [2024-10-12 19:17:09,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2119f2375/b9691288d431413eae023c0e7b13e780 [2024-10-12 19:17:09,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:17:09,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:17:09,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:17:09,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:17:09,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:17:09,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:17:09" (1/1) ... [2024-10-12 19:17:09,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fdfa2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:09, skipping insertion in model container [2024-10-12 19:17:09,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:17:09" (1/1) ... [2024-10-12 19:17:10,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:17:10,476 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_product24.cil.c[63703,63716] [2024-10-12 19:17:10,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:17:10,555 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:17:10,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-10-12 19:17:10,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [716] [2024-10-12 19:17:10,568 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2374] [2024-10-12 19:17:10,568 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2556] [2024-10-12 19:17:10,569 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2912] [2024-10-12 19:17:10,569 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3030] [2024-10-12 19:17:10,569 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3042] [2024-10-12 19:17:10,570 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3077] [2024-10-12 19:17:10,570 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3086] [2024-10-12 19:17:10,570 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3177] [2024-10-12 19:17:10,671 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_product24.cil.c[63703,63716] [2024-10-12 19:17:10,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:17:10,719 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:17:10,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10 WrapperNode [2024-10-12 19:17:10,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:17:10,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:17:10,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:17:10,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:17:10,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,828 INFO L138 Inliner]: procedures = 98, calls = 353, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 936 [2024-10-12 19:17:10,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:17:10,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:17:10,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:17:10,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:17:10,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,897 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-12 19:17:10,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:17:10,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:17:10,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:17:10,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:17:10,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (1/1) ... [2024-10-12 19:17:10,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:17:10,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:17:11,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:17:11,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:17:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-12 19:17:11,049 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-12 19:17:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:17:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:17:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:17:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:17:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:17:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:17:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:17:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:17:11,051 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:17:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:17:11,051 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-12 19:17:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-12 19:17:11,051 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-12 19:17:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-12 19:17:11,051 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:17:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:17:11,052 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:17:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:17:11,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:17:11,052 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-12 19:17:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-12 19:17:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-12 19:17:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-12 19:17:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-12 19:17:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-12 19:17:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:17:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:17:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:17:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:17:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-12 19:17:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-12 19:17:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:17:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:17:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:17:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:17:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:17:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:17:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:17:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:17:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:17:11,055 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:17:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:17:11,055 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:17:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:17:11,055 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:17:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:17:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:17:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:17:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:17:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:17:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:17:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:17:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:17:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:17:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:17:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:17:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:17:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:17:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:17:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:17:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:17:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:17:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:17:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:17:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:17:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:17:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:17:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-10-12 19:17:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-10-12 19:17:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:17:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:17:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:17:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:17:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-12 19:17:11,059 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-12 19:17:11,251 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:17:11,254 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:17:12,440 INFO L? ?]: Removed 473 outVars from TransFormulas that were not future-live. [2024-10-12 19:17:12,440 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:17:12,538 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:17:12,538 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:17:12,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:17:12 BoogieIcfgContainer [2024-10-12 19:17:12,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:17:12,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:17:12,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:17:12,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:17:12,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:17:09" (1/3) ... [2024-10-12 19:17:12,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6537b27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:17:12, skipping insertion in model container [2024-10-12 19:17:12,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:10" (2/3) ... [2024-10-12 19:17:12,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6537b27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:17:12, skipping insertion in model container [2024-10-12 19:17:12,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:17:12" (3/3) ... [2024-10-12 19:17:12,551 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product24.cil.c [2024-10-12 19:17:12,567 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:17:12,567 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:17:12,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:17:12,666 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;@61c427b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:17:12,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:17:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 574 states, 440 states have (on average 1.709090909090909) internal successors, (752), 463 states have internal predecessors, (752), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 19:17:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:17:12,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:12,690 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-12 19:17:12,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:12,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash -413035975, now seen corresponding path program 1 times [2024-10-12 19:17:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:12,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902321511] [2024-10-12 19:17:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:12,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:17:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:17:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:13,933 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-12 19:17:13,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902321511] [2024-10-12 19:17:13,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902321511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:13,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:13,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046822888] [2024-10-12 19:17:13,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:13,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:13,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:13,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:13,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:13,973 INFO L87 Difference]: Start difference. First operand has 574 states, 440 states have (on average 1.709090909090909) internal successors, (752), 463 states have internal predecessors, (752), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:19,102 INFO L93 Difference]: Finished difference Result 1293 states and 2195 transitions. [2024-10-12 19:17:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:19,104 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-12 19:17:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:19,124 INFO L225 Difference]: With dead ends: 1293 [2024-10-12 19:17:19,125 INFO L226 Difference]: Without dead ends: 728 [2024-10-12 19:17:19,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:19,141 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1177 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:19,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 1083 Invalid, 2998 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [279 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-12 19:17:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-12 19:17:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 570. [2024-10-12 19:17:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 438 states have (on average 1.6986301369863013) internal successors, (744), 459 states have internal predecessors, (744), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-12 19:17:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 949 transitions. [2024-10-12 19:17:19,358 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 949 transitions. Word has length 50 [2024-10-12 19:17:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:19,358 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 949 transitions. [2024-10-12 19:17:19,358 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-12 19:17:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 949 transitions. [2024-10-12 19:17:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:17:19,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:19,364 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-12 19:17:19,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:17:19,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:19,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1791506687, now seen corresponding path program 1 times [2024-10-12 19:17:19,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:19,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479515783] [2024-10-12 19:17:19,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:19,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:19,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:19,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:19,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:17:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:20,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:20,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:20,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:20,020 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-12 19:17:20,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:20,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479515783] [2024-10-12 19:17:20,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479515783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:20,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391946764] [2024-10-12 19:17:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:20,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:20,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:20,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:20,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:20,024 INFO L87 Difference]: Start difference. First operand 570 states and 949 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-12 19:17:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:24,670 INFO L93 Difference]: Finished difference Result 1286 states and 2168 transitions. [2024-10-12 19:17:24,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:24,671 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-12 19:17:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:24,679 INFO L225 Difference]: With dead ends: 1286 [2024-10-12 19:17:24,679 INFO L226 Difference]: Without dead ends: 728 [2024-10-12 19:17:24,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:24,684 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 705 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 2855 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:24,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1086 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2855 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-12 19:17:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-12 19:17:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 570. [2024-10-12 19:17:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 438 states have (on average 1.6963470319634704) internal successors, (743), 459 states have internal predecessors, (743), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-12 19:17:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 948 transitions. [2024-10-12 19:17:24,804 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 948 transitions. Word has length 52 [2024-10-12 19:17:24,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:24,805 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 948 transitions. [2024-10-12 19:17:24,805 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-12 19:17:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 948 transitions. [2024-10-12 19:17:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:17:24,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:24,808 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-12 19:17:24,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:17:24,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:24,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:24,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1111838289, now seen corresponding path program 1 times [2024-10-12 19:17:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:24,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960196372] [2024-10-12 19:17:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:25,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:25,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:17:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:25,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 19:17:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:25,388 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-12 19:17:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960196372] [2024-10-12 19:17:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960196372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:25,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054768687] [2024-10-12 19:17:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:25,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:25,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:25,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:25,390 INFO L87 Difference]: Start difference. First operand 570 states and 948 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-12 19:17:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:29,385 INFO L93 Difference]: Finished difference Result 1286 states and 2167 transitions. [2024-10-12 19:17:29,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:29,385 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-12 19:17:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:29,391 INFO L225 Difference]: With dead ends: 1286 [2024-10-12 19:17:29,391 INFO L226 Difference]: Without dead ends: 728 [2024-10-12 19:17:29,394 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-12 19:17:29,396 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 704 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:29,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1077 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 19:17:29,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-12 19:17:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 570. [2024-10-12 19:17:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 438 states have (on average 1.6940639269406392) internal successors, (742), 459 states have internal predecessors, (742), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-12 19:17:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 947 transitions. [2024-10-12 19:17:29,517 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 947 transitions. Word has length 53 [2024-10-12 19:17:29,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:29,518 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 947 transitions. [2024-10-12 19:17:29,518 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-12 19:17:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 947 transitions. [2024-10-12 19:17:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 19:17:29,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:29,520 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-12 19:17:29,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:17:29,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:29,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:29,521 INFO L85 PathProgramCache]: Analyzing trace with hash 270018245, now seen corresponding path program 1 times [2024-10-12 19:17:29,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:29,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009652866] [2024-10-12 19:17:29,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:29,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:17:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:30,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:17:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:30,117 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-12 19:17:30,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009652866] [2024-10-12 19:17:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009652866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:30,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198773890] [2024-10-12 19:17:30,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:30,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:30,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:30,120 INFO L87 Difference]: Start difference. First operand 570 states and 947 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-12 19:17:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:34,063 INFO L93 Difference]: Finished difference Result 1286 states and 2166 transitions. [2024-10-12 19:17:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:34,064 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-12 19:17:34,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:34,069 INFO L225 Difference]: With dead ends: 1286 [2024-10-12 19:17:34,069 INFO L226 Difference]: Without dead ends: 728 [2024-10-12 19:17:34,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:34,074 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1165 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:34,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1090 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 19:17:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-12 19:17:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 570. [2024-10-12 19:17:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 438 states have (on average 1.6917808219178083) internal successors, (741), 459 states have internal predecessors, (741), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-12 19:17:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 946 transitions. [2024-10-12 19:17:34,184 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 946 transitions. Word has length 54 [2024-10-12 19:17:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:34,184 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 946 transitions. [2024-10-12 19:17:34,185 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-12 19:17:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 946 transitions. [2024-10-12 19:17:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 19:17:34,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:34,186 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-12 19:17:34,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:17:34,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:34,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:34,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1944870515, now seen corresponding path program 1 times [2024-10-12 19:17:34,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:34,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147223034] [2024-10-12 19:17:34,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:34,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:17:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:17:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,725 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-12 19:17:34,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:34,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147223034] [2024-10-12 19:17:34,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147223034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:34,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:34,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:34,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110386725] [2024-10-12 19:17:34,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:34,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:34,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:34,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:34,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:34,727 INFO L87 Difference]: Start difference. First operand 570 states and 946 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-12 19:17:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:38,826 INFO L93 Difference]: Finished difference Result 1286 states and 2165 transitions. [2024-10-12 19:17:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:38,826 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-12 19:17:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:38,832 INFO L225 Difference]: With dead ends: 1286 [2024-10-12 19:17:38,832 INFO L226 Difference]: Without dead ends: 728 [2024-10-12 19:17:38,835 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-12 19:17:38,836 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 700 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2843 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 2966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:38,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1077 Invalid, 2966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2843 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-12 19:17:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-12 19:17:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 570. [2024-10-12 19:17:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 438 states have (on average 1.6894977168949772) internal successors, (740), 459 states have internal predecessors, (740), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-12 19:17:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 945 transitions. [2024-10-12 19:17:38,934 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 945 transitions. Word has length 55 [2024-10-12 19:17:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:38,935 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 945 transitions. [2024-10-12 19:17:38,935 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-12 19:17:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 945 transitions. [2024-10-12 19:17:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:17:38,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:38,937 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-12 19:17:38,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:17:38,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:38,938 INFO L85 PathProgramCache]: Analyzing trace with hash -182311287, now seen corresponding path program 1 times [2024-10-12 19:17:38,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:38,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143335185] [2024-10-12 19:17:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:39,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:39,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:39,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:39,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:17:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:39,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:39,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:39,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:39,595 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-12 19:17:39,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:39,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143335185] [2024-10-12 19:17:39,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143335185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:39,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:39,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:17:39,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409397178] [2024-10-12 19:17:39,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:39,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:17:39,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:39,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:17:39,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:17:39,597 INFO L87 Difference]: Start difference. First operand 570 states and 945 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 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-12 19:17:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:45,211 INFO L93 Difference]: Finished difference Result 1262 states and 2114 transitions. [2024-10-12 19:17:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:17:45,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 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 56 [2024-10-12 19:17:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:45,217 INFO L225 Difference]: With dead ends: 1262 [2024-10-12 19:17:45,217 INFO L226 Difference]: Without dead ends: 752 [2024-10-12 19:17:45,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:17:45,222 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1256 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 5044 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 5328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 5044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:45,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1958 Invalid, 5328 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [284 Valid, 5044 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-12 19:17:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-12 19:17:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 582. [2024-10-12 19:17:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.686800894854586) internal successors, (754), 470 states have internal predecessors, (754), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-12 19:17:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 963 transitions. [2024-10-12 19:17:45,350 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 963 transitions. Word has length 56 [2024-10-12 19:17:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:45,350 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 963 transitions. [2024-10-12 19:17:45,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 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-12 19:17:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 963 transitions. [2024-10-12 19:17:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:17:45,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:45,352 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-12 19:17:45,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:17:45,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:45,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1883051766, now seen corresponding path program 1 times [2024-10-12 19:17:45,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:45,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012951725] [2024-10-12 19:17:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:45,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:17:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,854 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-12 19:17:45,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012951725] [2024-10-12 19:17:45,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012951725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:45,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:45,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:45,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393847947] [2024-10-12 19:17:45,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:45,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:45,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:45,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:45,858 INFO L87 Difference]: Start difference. First operand 582 states and 963 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-12 19:17:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:49,671 INFO L93 Difference]: Finished difference Result 1284 states and 2152 transitions. [2024-10-12 19:17:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:49,672 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-12 19:17:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:49,676 INFO L225 Difference]: With dead ends: 1284 [2024-10-12 19:17:49,676 INFO L226 Difference]: Without dead ends: 758 [2024-10-12 19:17:49,679 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-12 19:17:49,680 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1231 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:49,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 1069 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-12 19:17:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-12 19:17:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 582. [2024-10-12 19:17:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.6756152125279642) internal successors, (749), 470 states have internal predecessors, (749), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-12 19:17:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 958 transitions. [2024-10-12 19:17:49,784 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 958 transitions. Word has length 56 [2024-10-12 19:17:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:49,785 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 958 transitions. [2024-10-12 19:17:49,785 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-12 19:17:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 958 transitions. [2024-10-12 19:17:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:17:49,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:49,787 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-12 19:17:49,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:17:49,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:49,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash -320933887, now seen corresponding path program 1 times [2024-10-12 19:17:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:49,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546190782] [2024-10-12 19:17:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:49,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:49,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:49,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:17:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:50,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:50,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:50,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:50,341 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-12 19:17:50,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:50,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546190782] [2024-10-12 19:17:50,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546190782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:50,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:50,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175559833] [2024-10-12 19:17:50,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:50,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:50,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:50,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:50,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:50,346 INFO L87 Difference]: Start difference. First operand 582 states and 958 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-12 19:17:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:53,919 INFO L93 Difference]: Finished difference Result 1284 states and 2147 transitions. [2024-10-12 19:17:53,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:53,920 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-12 19:17:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:53,926 INFO L225 Difference]: With dead ends: 1284 [2024-10-12 19:17:53,927 INFO L226 Difference]: Without dead ends: 758 [2024-10-12 19:17:53,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:17:53,932 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1225 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:53,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 1090 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 19:17:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-12 19:17:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 582. [2024-10-12 19:17:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.6644295302013423) internal successors, (744), 470 states have internal predecessors, (744), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-12 19:17:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 953 transitions. [2024-10-12 19:17:54,065 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 953 transitions. Word has length 57 [2024-10-12 19:17:54,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:54,065 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 953 transitions. [2024-10-12 19:17:54,066 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-12 19:17:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 953 transitions. [2024-10-12 19:17:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:17:54,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:54,067 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-12 19:17:54,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:17:54,067 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:54,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash 434165509, now seen corresponding path program 1 times [2024-10-12 19:17:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:54,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897832849] [2024-10-12 19:17:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:54,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:17:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:54,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:54,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:54,583 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-12 19:17:54,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:54,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897832849] [2024-10-12 19:17:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897832849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:54,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:54,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468980844] [2024-10-12 19:17:54,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:54,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:54,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:54,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:54,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:54,585 INFO L87 Difference]: Start difference. First operand 582 states and 953 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-12 19:17:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:58,315 INFO L93 Difference]: Finished difference Result 1284 states and 2142 transitions. [2024-10-12 19:17:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:58,315 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-12 19:17:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:58,320 INFO L225 Difference]: With dead ends: 1284 [2024-10-12 19:17:58,321 INFO L226 Difference]: Without dead ends: 758 [2024-10-12 19:17:58,324 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-12 19:17:58,324 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 757 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2769 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:58,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1077 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2769 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 19:17:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-12 19:17:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 582. [2024-10-12 19:17:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.6532438478747205) internal successors, (739), 470 states have internal predecessors, (739), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-12 19:17:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 948 transitions. [2024-10-12 19:17:58,432 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 948 transitions. Word has length 58 [2024-10-12 19:17:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:58,432 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 948 transitions. [2024-10-12 19:17:58,432 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-12 19:17:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 948 transitions. [2024-10-12 19:17:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:17:58,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:58,434 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-12 19:17:58,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:17:58,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:58,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:58,435 INFO L85 PathProgramCache]: Analyzing trace with hash 183120508, now seen corresponding path program 1 times [2024-10-12 19:17:58,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:58,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026164810] [2024-10-12 19:17:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:58,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:58,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:17:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:59,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:59,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:59,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:59,027 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-12 19:17:59,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:59,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026164810] [2024-10-12 19:17:59,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026164810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:59,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:59,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:17:59,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108727143] [2024-10-12 19:17:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:59,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:17:59,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:59,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:17:59,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:17:59,029 INFO L87 Difference]: Start difference. First operand 582 states and 948 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-12 19:18:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:04,323 INFO L93 Difference]: Finished difference Result 1264 states and 2100 transitions. [2024-10-12 19:18:04,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:18:04,323 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-12 19:18:04,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:04,327 INFO L225 Difference]: With dead ends: 1264 [2024-10-12 19:18:04,327 INFO L226 Difference]: Without dead ends: 752 [2024-10-12 19:18:04,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:18:04,330 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 746 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 5075 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 5204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 5075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:04,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1870 Invalid, 5204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 5075 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-12 19:18:04,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-12 19:18:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 582. [2024-10-12 19:18:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.651006711409396) internal successors, (738), 470 states have internal predecessors, (738), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-12 19:18:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 947 transitions. [2024-10-12 19:18:04,438 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 947 transitions. Word has length 59 [2024-10-12 19:18:04,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:04,438 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 947 transitions. [2024-10-12 19:18:04,438 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-12 19:18:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 947 transitions. [2024-10-12 19:18:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:18:04,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:04,440 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-12 19:18:04,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:18:04,440 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:04,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1941495708, now seen corresponding path program 1 times [2024-10-12 19:18:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:04,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10810665] [2024-10-12 19:18:04,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:18:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,983 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-12 19:18:04,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:04,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10810665] [2024-10-12 19:18:04,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10810665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:04,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:04,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449979928] [2024-10-12 19:18:04,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:04,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:04,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:04,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:04,988 INFO L87 Difference]: Start difference. First operand 582 states and 947 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-12 19:18:08,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:08,615 INFO L93 Difference]: Finished difference Result 1284 states and 2133 transitions. [2024-10-12 19:18:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:18:08,616 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-12 19:18:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:08,620 INFO L225 Difference]: With dead ends: 1284 [2024-10-12 19:18:08,620 INFO L226 Difference]: Without dead ends: 758 [2024-10-12 19:18:08,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:08,623 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1224 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:08,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 1074 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2602 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 19:18:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-12 19:18:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 582. [2024-10-12 19:18:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.639821029082774) internal successors, (733), 470 states have internal predecessors, (733), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-12 19:18:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 942 transitions. [2024-10-12 19:18:08,730 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 942 transitions. Word has length 59 [2024-10-12 19:18:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:08,730 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 942 transitions. [2024-10-12 19:18:08,731 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-12 19:18:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 942 transitions. [2024-10-12 19:18:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 19:18:08,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:08,732 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-12 19:18:08,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:18:08,732 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:08,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash -296697886, now seen corresponding path program 1 times [2024-10-12 19:18:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730166321] [2024-10-12 19:18:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:09,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:18:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:09,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:09,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:09,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:09,343 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-12 19:18:09,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:09,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730166321] [2024-10-12 19:18:09,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730166321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:09,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:09,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:18:09,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631415851] [2024-10-12 19:18:09,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:09,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:18:09,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:09,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:18:09,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:18:09,345 INFO L87 Difference]: Start difference. First operand 582 states and 942 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-12 19:18:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:14,444 INFO L93 Difference]: Finished difference Result 1272 states and 2103 transitions. [2024-10-12 19:18:14,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:18:14,445 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-12 19:18:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:14,450 INFO L225 Difference]: With dead ends: 1272 [2024-10-12 19:18:14,450 INFO L226 Difference]: Without dead ends: 758 [2024-10-12 19:18:14,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:18:14,453 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1212 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 4882 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 5166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 4882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:14,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 1916 Invalid, 5166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 4882 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-12 19:18:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-12 19:18:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 585. [2024-10-12 19:18:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 450 states have (on average 1.6333333333333333) internal successors, (735), 473 states have internal predecessors, (735), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-12 19:18:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 944 transitions. [2024-10-12 19:18:14,580 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 944 transitions. Word has length 60 [2024-10-12 19:18:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:14,582 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 944 transitions. [2024-10-12 19:18:14,583 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-12 19:18:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 944 transitions. [2024-10-12 19:18:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 19:18:14,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:14,585 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-12 19:18:14,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:18:14,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:14,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash 998177024, now seen corresponding path program 1 times [2024-10-12 19:18:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:14,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452317399] [2024-10-12 19:18:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:18:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:15,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452317399] [2024-10-12 19:18:15,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452317399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:15,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:15,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:15,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766178626] [2024-10-12 19:18:15,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:15,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:15,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:15,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:15,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:15,132 INFO L87 Difference]: Start difference. First operand 585 states and 944 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-12 19:18:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:18,480 INFO L93 Difference]: Finished difference Result 1293 states and 2133 transitions. [2024-10-12 19:18:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:18:18,480 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-12 19:18:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:18,485 INFO L225 Difference]: With dead ends: 1293 [2024-10-12 19:18:18,485 INFO L226 Difference]: Without dead ends: 764 [2024-10-12 19:18:18,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:18,488 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1225 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:18,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 1060 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:18:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-10-12 19:18:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 585. [2024-10-12 19:18:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 450 states have (on average 1.6222222222222222) internal successors, (730), 473 states have internal predecessors, (730), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-12 19:18:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 939 transitions. [2024-10-12 19:18:18,595 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 939 transitions. Word has length 60 [2024-10-12 19:18:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:18,595 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 939 transitions. [2024-10-12 19:18:18,595 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-12 19:18:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 939 transitions. [2024-10-12 19:18:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 19:18:18,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:18,597 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-12 19:18:18,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:18:18,597 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:18,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1124599529, now seen corresponding path program 1 times [2024-10-12 19:18:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:18,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058251090] [2024-10-12 19:18:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:18,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:18,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:18,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:19,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:18:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:19,120 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-12 19:18:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:19,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058251090] [2024-10-12 19:18:19,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058251090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:19,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:19,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:19,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087620239] [2024-10-12 19:18:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:19,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:19,122 INFO L87 Difference]: Start difference. First operand 585 states and 939 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:22,857 INFO L93 Difference]: Finished difference Result 1276 states and 2100 transitions. [2024-10-12 19:18:22,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:18:22,858 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-12 19:18:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:22,863 INFO L225 Difference]: With dead ends: 1276 [2024-10-12 19:18:22,863 INFO L226 Difference]: Without dead ends: 762 [2024-10-12 19:18:22,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:18:22,865 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 734 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 2690 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:22,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1028 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2690 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 19:18:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-10-12 19:18:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 589. [2024-10-12 19:18:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 454 states have (on average 1.6145374449339207) internal successors, (733), 477 states have internal predecessors, (733), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-12 19:18:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2024-10-12 19:18:22,962 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 61 [2024-10-12 19:18:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:22,962 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2024-10-12 19:18:22,963 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), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2024-10-12 19:18:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 19:18:22,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:22,964 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-12 19:18:22,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:18:22,964 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:22,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1394154295, now seen corresponding path program 1 times [2024-10-12 19:18:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:22,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615604413] [2024-10-12 19:18:22,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:22,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:18:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,449 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-12 19:18:23,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:23,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615604413] [2024-10-12 19:18:23,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615604413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:23,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533330784] [2024-10-12 19:18:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:23,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:23,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:23,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:23,451 INFO L87 Difference]: Start difference. First operand 589 states and 942 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-12 19:18:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:27,042 INFO L93 Difference]: Finished difference Result 1331 states and 2163 transitions. [2024-10-12 19:18:27,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:18:27,042 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-12 19:18:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:27,046 INFO L225 Difference]: With dead ends: 1331 [2024-10-12 19:18:27,046 INFO L226 Difference]: Without dead ends: 736 [2024-10-12 19:18:27,048 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-12 19:18:27,048 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1157 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:27,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 1066 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:18:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-12 19:18:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 571. [2024-10-12 19:18:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 439 states have (on average 1.6218678815489749) internal successors, (712), 460 states have internal predecessors, (712), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-12 19:18:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 917 transitions. [2024-10-12 19:18:27,147 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 917 transitions. Word has length 61 [2024-10-12 19:18:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:27,148 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 917 transitions. [2024-10-12 19:18:27,148 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-12 19:18:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 917 transitions. [2024-10-12 19:18:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 19:18:27,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:27,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:27,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:18:27,149 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:27,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash 141819997, now seen corresponding path program 1 times [2024-10-12 19:18:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:27,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200969681] [2024-10-12 19:18:27,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:27,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:27,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:18:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:27,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:27,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:27,700 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-12 19:18:27,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:27,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200969681] [2024-10-12 19:18:27,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200969681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:27,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:27,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:18:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556947624] [2024-10-12 19:18:27,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:27,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:18:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:27,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:18:27,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:18:27,702 INFO L87 Difference]: Start difference. First operand 571 states and 917 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 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)