./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.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_spec9_product29.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 bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:21:00,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:21:00,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:21:00,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:21:00,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:21:00,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:21:00,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:21:00,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:21:00,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:21:00,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:21:00,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:21:00,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:21:00,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:21:00,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:21:00,673 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:21:00,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:21:00,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:21:00,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:21:00,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:21:00,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:21:00,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:21:00,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:21:00,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:21:00,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:21:00,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:21:00,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:21:00,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:21:00,677 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:21:00,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:21:00,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:21:00,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:21:00,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:21:00,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:21:00,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:21:00,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:21:00,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:21:00,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:21:00,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:21:00,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:21:00,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:21:00,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:21:00,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:21:00,680 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 -> bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 [2024-10-12 19:21:00,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:21:00,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:21:00,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:21:00,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:21:00,904 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:21:00,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2024-10-12 19:21:02,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:21:02,300 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:21:02,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2024-10-12 19:21:02,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7262ee463/1638ec3b457a46469be8a496cef699ee/FLAG76a82a6f2 [2024-10-12 19:21:02,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7262ee463/1638ec3b457a46469be8a496cef699ee [2024-10-12 19:21:02,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:21:02,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:21:02,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:21:02,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:21:02,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:21:02,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:21:02" (1/1) ... [2024-10-12 19:21:02,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5691a8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:02, skipping insertion in model container [2024-10-12 19:21:02,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:21:02" (1/1) ... [2024-10-12 19:21:02,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:21:02,819 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c[1700,1713] [2024-10-12 19:21:03,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:21:03,082 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:21:03,088 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-10-12 19:21:03,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [62] [2024-10-12 19:21:03,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [71] [2024-10-12 19:21:03,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [235] [2024-10-12 19:21:03,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [903] [2024-10-12 19:21:03,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1263] [2024-10-12 19:21:03,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1355] [2024-10-12 19:21:03,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1390] [2024-10-12 19:21:03,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1756] [2024-10-12 19:21:03,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3289] [2024-10-12 19:21:03,092 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c[1700,1713] [2024-10-12 19:21:03,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:21:03,170 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:21:03,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03 WrapperNode [2024-10-12 19:21:03,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:21:03,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:21:03,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:21:03,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:21:03,177 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:21:03" (1/1) ... [2024-10-12 19:21:03,200 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:21:03" (1/1) ... [2024-10-12 19:21:03,235 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 863 [2024-10-12 19:21:03,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:21:03,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:21:03,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:21:03,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:21:03,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (1/1) ... [2024-10-12 19:21:03,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (1/1) ... [2024-10-12 19:21:03,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (1/1) ... [2024-10-12 19:21:03,281 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-12 19:21:03,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (1/1) ... [2024-10-12 19:21:03,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (1/1) ... [2024-10-12 19:21:03,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (1/1) ... [2024-10-12 19:21:03,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (1/1) ... [2024-10-12 19:21:03,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (1/1) ... [2024-10-12 19:21:03,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (1/1) ... [2024-10-12 19:21:03,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:21:03,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:21:03,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:21:03,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:21:03,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (1/1) ... [2024-10-12 19:21:03,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:21:03,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:21:03,358 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:21:03,365 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:21:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:21:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-12 19:21:03,396 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-12 19:21:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-12 19:21:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-12 19:21:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:21:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:21:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:21:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:21:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:21:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:21:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-12 19:21:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-12 19:21:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:21:03,399 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:21:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:21:03,399 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:21:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:21:03,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:21:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:21:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:21:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:21:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:21:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:21:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:21:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-12 19:21:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-12 19:21:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:21:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:21:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:21:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:21:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:21:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:21:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:21:03,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:21:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:21:03,403 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:21:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-10-12 19:21:03,403 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-10-12 19:21:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:21:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:21:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:21:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:21:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:21:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:21:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:21:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:21:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:21:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:21:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:21:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:21:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:21:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:21:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:21:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:21:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:21:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:21:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:21:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:21:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-12 19:21:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-12 19:21:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:21:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:21:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:21:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:21:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:21:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:21:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:21:03,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:21:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:21:03,407 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:21:03,582 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:21:03,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:21:04,500 INFO L? ?]: Removed 454 outVars from TransFormulas that were not future-live. [2024-10-12 19:21:04,501 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:21:04,581 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:21:04,581 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:21:04,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:21:04 BoogieIcfgContainer [2024-10-12 19:21:04,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:21:04,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:21:04,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:21:04,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:21:04,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:21:02" (1/3) ... [2024-10-12 19:21:04,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d6a73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:21:04, skipping insertion in model container [2024-10-12 19:21:04,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:21:03" (2/3) ... [2024-10-12 19:21:04,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d6a73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:21:04, skipping insertion in model container [2024-10-12 19:21:04,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:21:04" (3/3) ... [2024-10-12 19:21:04,590 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2024-10-12 19:21:04,601 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:21:04,602 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:21:04,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:21:04,667 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;@5e794ca4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:21:04,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:21:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 542 states, 424 states have (on average 1.7334905660377358) internal successors, (735), 445 states have internal predecessors, (735), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-12 19:21:04,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:21:04,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:04,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:04,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:04,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash -853912051, now seen corresponding path program 1 times [2024-10-12 19:21:04,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:04,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390249915] [2024-10-12 19:21:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:04,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:21:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:21:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:21:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 19:21:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:21:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:21:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:21:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:05,678 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:21:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:05,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390249915] [2024-10-12 19:21:05,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390249915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:05,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:05,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:21:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248502369] [2024-10-12 19:21:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:05,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:21:05,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:21:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:21:05,708 INFO L87 Difference]: Start difference. First operand has 542 states, 424 states have (on average 1.7334905660377358) internal successors, (735), 445 states have internal predecessors, (735), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:09,764 INFO L93 Difference]: Finished difference Result 1298 states and 2234 transitions. [2024-10-12 19:21:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:21:09,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 81 [2024-10-12 19:21:09,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:09,791 INFO L225 Difference]: With dead ends: 1298 [2024-10-12 19:21:09,791 INFO L226 Difference]: Without dead ends: 765 [2024-10-12 19:21:09,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:21:09,802 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1865 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:09,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 1464 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 2805 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 19:21:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-12 19:21:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-12 19:21:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 422 states have (on average 1.7227488151658767) internal successors, (727), 441 states have internal predecessors, (727), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-12 19:21:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 906 transitions. [2024-10-12 19:21:09,972 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 906 transitions. Word has length 81 [2024-10-12 19:21:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:09,973 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 906 transitions. [2024-10-12 19:21:09,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 906 transitions. [2024-10-12 19:21:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 19:21:09,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:09,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:09,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:21:09,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:09,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash -609393153, now seen corresponding path program 1 times [2024-10-12 19:21:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:09,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784736285] [2024-10-12 19:21:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:21:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:21:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:21:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 19:21:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:21:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:21:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:21:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:10,517 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:21:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784736285] [2024-10-12 19:21:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784736285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:21:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920165823] [2024-10-12 19:21:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:10,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:21:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:21:10,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:21:10,520 INFO L87 Difference]: Start difference. First operand 538 states and 906 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:14,214 INFO L93 Difference]: Finished difference Result 1291 states and 2203 transitions. [2024-10-12 19:21:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:21:14,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 83 [2024-10-12 19:21:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:14,221 INFO L225 Difference]: With dead ends: 1291 [2024-10-12 19:21:14,221 INFO L226 Difference]: Without dead ends: 765 [2024-10-12 19:21:14,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:21:14,224 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 1403 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 2963 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 2963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:14,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1508 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 2963 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 19:21:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-12 19:21:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-12 19:21:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 422 states have (on average 1.7203791469194314) internal successors, (726), 441 states have internal predecessors, (726), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-12 19:21:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 905 transitions. [2024-10-12 19:21:14,321 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 905 transitions. Word has length 83 [2024-10-12 19:21:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:14,322 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 905 transitions. [2024-10-12 19:21:14,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 905 transitions. [2024-10-12 19:21:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 19:21:14,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:14,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:14,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:21:14,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:14,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:14,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1835312252, now seen corresponding path program 1 times [2024-10-12 19:21:14,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:14,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773341419] [2024-10-12 19:21:14,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:21:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 19:21:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:21:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 19:21:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:21:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:21:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:21:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:14,810 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:21:14,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773341419] [2024-10-12 19:21:14,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773341419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:14,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:14,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:21:14,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790194969] [2024-10-12 19:21:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:14,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:21:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:14,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:21:14,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:21:14,812 INFO L87 Difference]: Start difference. First operand 538 states and 905 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:18,189 INFO L93 Difference]: Finished difference Result 1291 states and 2202 transitions. [2024-10-12 19:21:18,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:21:18,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2024-10-12 19:21:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:18,194 INFO L225 Difference]: With dead ends: 1291 [2024-10-12 19:21:18,194 INFO L226 Difference]: Without dead ends: 765 [2024-10-12 19:21:18,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:21:18,197 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 1865 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:18,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 1443 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:21:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-12 19:21:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-12 19:21:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 422 states have (on average 1.7180094786729858) internal successors, (725), 441 states have internal predecessors, (725), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-12 19:21:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 904 transitions. [2024-10-12 19:21:18,274 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 904 transitions. Word has length 84 [2024-10-12 19:21:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:18,274 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 904 transitions. [2024-10-12 19:21:18,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 904 transitions. [2024-10-12 19:21:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 19:21:18,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:18,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:18,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:21:18,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:18,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:18,277 INFO L85 PathProgramCache]: Analyzing trace with hash 452061979, now seen corresponding path program 1 times [2024-10-12 19:21:18,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:18,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564250084] [2024-10-12 19:21:18,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:18,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:21:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:21:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:21:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 19:21:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:21:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:21:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:21:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:18,750 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:21:18,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564250084] [2024-10-12 19:21:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564250084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:18,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:18,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:21:18,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079828605] [2024-10-12 19:21:18,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:18,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:21:18,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:18,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:21:18,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:21:18,752 INFO L87 Difference]: Start difference. First operand 538 states and 904 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:22,150 INFO L93 Difference]: Finished difference Result 1291 states and 2201 transitions. [2024-10-12 19:21:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:21:22,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 85 [2024-10-12 19:21:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:22,154 INFO L225 Difference]: With dead ends: 1291 [2024-10-12 19:21:22,154 INFO L226 Difference]: Without dead ends: 765 [2024-10-12 19:21:22,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:21:22,157 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 1410 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:22,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1485 Invalid, 3174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:21:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-12 19:21:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-12 19:21:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 422 states have (on average 1.7156398104265402) internal successors, (724), 441 states have internal predecessors, (724), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-12 19:21:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 903 transitions. [2024-10-12 19:21:22,228 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 903 transitions. Word has length 85 [2024-10-12 19:21:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:22,229 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 903 transitions. [2024-10-12 19:21:22,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 903 transitions. [2024-10-12 19:21:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 19:21:22,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:22,231 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:22,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:21:22,232 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:22,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:22,232 INFO L85 PathProgramCache]: Analyzing trace with hash 661269976, now seen corresponding path program 1 times [2024-10-12 19:21:22,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:22,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821968028] [2024-10-12 19:21:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:21:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:21:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:21:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 19:21:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:21:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:21:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:21:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:22,891 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:21:22,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:22,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821968028] [2024-10-12 19:21:22,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821968028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:22,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:22,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 19:21:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357551958] [2024-10-12 19:21:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:22,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 19:21:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:22,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 19:21:22,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:21:22,895 INFO L87 Difference]: Start difference. First operand 538 states and 903 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:28,822 INFO L93 Difference]: Finished difference Result 1300 states and 2222 transitions. [2024-10-12 19:21:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:21:28,822 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 86 [2024-10-12 19:21:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:28,826 INFO L225 Difference]: With dead ends: 1300 [2024-10-12 19:21:28,826 INFO L226 Difference]: Without dead ends: 774 [2024-10-12 19:21:28,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2024-10-12 19:21:28,828 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 969 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 7902 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 8112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 7902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:28,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 3839 Invalid, 8112 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [210 Valid, 7902 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-12 19:21:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-12 19:21:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 545. [2024-10-12 19:21:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 427 states have (on average 1.7049180327868851) internal successors, (728), 446 states have internal predecessors, (728), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 87 states have call predecessors, (92), 87 states have call successors, (92) [2024-10-12 19:21:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 912 transitions. [2024-10-12 19:21:28,928 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 912 transitions. Word has length 86 [2024-10-12 19:21:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:28,929 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 912 transitions. [2024-10-12 19:21:28,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 912 transitions. [2024-10-12 19:21:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 19:21:28,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:28,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:28,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:21:28,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash -240309307, now seen corresponding path program 1 times [2024-10-12 19:21:28,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:28,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051505389] [2024-10-12 19:21:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:21:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:21:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:21:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:21:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:21:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:21:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:29,587 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:21:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:29,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051505389] [2024-10-12 19:21:29,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051505389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:29,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:29,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 19:21:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904496077] [2024-10-12 19:21:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:29,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:21:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:29,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:21:29,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:21:29,588 INFO L87 Difference]: Start difference. First operand 545 states and 912 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:35,188 INFO L93 Difference]: Finished difference Result 1284 states and 2181 transitions. [2024-10-12 19:21:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:21:35,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 88 [2024-10-12 19:21:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:35,192 INFO L225 Difference]: With dead ends: 1284 [2024-10-12 19:21:35,192 INFO L226 Difference]: Without dead ends: 791 [2024-10-12 19:21:35,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:21:35,194 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1466 mSDsluCounter, 3072 mSDsCounter, 0 mSdLazyCounter, 7067 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 3482 SdHoareTripleChecker+Invalid, 7417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 7067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:35,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 3482 Invalid, 7417 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [350 Valid, 7067 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-12 19:21:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-10-12 19:21:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 546. [2024-10-12 19:21:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 428 states have (on average 1.691588785046729) internal successors, (724), 446 states have internal predecessors, (724), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 88 states have call predecessors, (92), 87 states have call successors, (92) [2024-10-12 19:21:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 908 transitions. [2024-10-12 19:21:35,286 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 908 transitions. Word has length 88 [2024-10-12 19:21:35,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:35,286 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 908 transitions. [2024-10-12 19:21:35,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 908 transitions. [2024-10-12 19:21:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 19:21:35,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:35,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:35,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:21:35,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:35,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:35,289 INFO L85 PathProgramCache]: Analyzing trace with hash 748065232, now seen corresponding path program 1 times [2024-10-12 19:21:35,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:35,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216765290] [2024-10-12 19:21:35,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:21:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:21:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:21:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:21:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:21:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:21:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:35,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:21:35,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:35,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216765290] [2024-10-12 19:21:35,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216765290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:35,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:35,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:21:35,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557876795] [2024-10-12 19:21:35,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:35,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:21:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:21:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:21:35,856 INFO L87 Difference]: Start difference. First operand 546 states and 908 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:40,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:40,156 INFO L93 Difference]: Finished difference Result 1282 states and 2170 transitions. [2024-10-12 19:21:40,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:21:40,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-12 19:21:40,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:40,176 INFO L225 Difference]: With dead ends: 1282 [2024-10-12 19:21:40,176 INFO L226 Difference]: Without dead ends: 788 [2024-10-12 19:21:40,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:21:40,178 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 1470 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 5311 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 5662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 5311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:40,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 2634 Invalid, 5662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 5311 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 19:21:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-12 19:21:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 549. [2024-10-12 19:21:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 431 states have (on average 1.6751740139211138) internal successors, (722), 449 states have internal predecessors, (722), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 88 states have call predecessors, (92), 87 states have call successors, (92) [2024-10-12 19:21:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 906 transitions. [2024-10-12 19:21:40,258 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 906 transitions. Word has length 89 [2024-10-12 19:21:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:40,259 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 906 transitions. [2024-10-12 19:21:40,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:21:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 906 transitions. [2024-10-12 19:21:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 19:21:40,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:40,261 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:40,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:21:40,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:40,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2134440608, now seen corresponding path program 1 times [2024-10-12 19:21:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:40,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868752749] [2024-10-12 19:21:40,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:40,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:21:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:21:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:21:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:21:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:21:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:21:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:21:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:21:40,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:40,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868752749] [2024-10-12 19:21:40,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868752749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:40,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:40,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 19:21:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370062024] [2024-10-12 19:21:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:40,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:21:40,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:40,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:21:40,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:21:40,874 INFO L87 Difference]: Start difference. First operand 549 states and 906 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:21:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:46,394 INFO L93 Difference]: Finished difference Result 1301 states and 2201 transitions. [2024-10-12 19:21:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 19:21:46,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 92 [2024-10-12 19:21:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:46,398 INFO L225 Difference]: With dead ends: 1301 [2024-10-12 19:21:46,398 INFO L226 Difference]: Without dead ends: 812 [2024-10-12 19:21:46,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2024-10-12 19:21:46,402 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1039 mSDsluCounter, 3114 mSDsCounter, 0 mSdLazyCounter, 7036 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 7251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 7036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:46,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 3524 Invalid, 7251 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [215 Valid, 7036 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-12 19:21:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-12 19:21:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 564. [2024-10-12 19:21:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 443 states have (on average 1.670428893905192) internal successors, (740), 463 states have internal predecessors, (740), 93 states have call successors, (93), 24 states have call predecessors, (93), 27 states have return successors, (95), 89 states have call predecessors, (95), 88 states have call successors, (95) [2024-10-12 19:21:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 928 transitions. [2024-10-12 19:21:46,487 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 928 transitions. Word has length 92 [2024-10-12 19:21:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:46,487 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 928 transitions. [2024-10-12 19:21:46,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:21:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 928 transitions. [2024-10-12 19:21:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 19:21:46,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:46,490 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:46,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:21:46,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:46,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:46,491 INFO L85 PathProgramCache]: Analyzing trace with hash -601725165, now seen corresponding path program 1 times [2024-10-12 19:21:46,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:46,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668028267] [2024-10-12 19:21:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:46,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:21:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:46,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:21:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:21:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:47,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 19:21:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:47,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:21:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:21:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:21:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:21:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:47,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668028267] [2024-10-12 19:21:47,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668028267] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:21:47,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098584561] [2024-10-12 19:21:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:47,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:21:47,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:21:47,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:21:47,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:21:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:47,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:21:47,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:21:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:21:47,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:21:47,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098584561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:47,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:21:47,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 14 [2024-10-12 19:21:47,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085102901] [2024-10-12 19:21:47,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:47,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:21:47,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:47,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:21:47,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:21:47,309 INFO L87 Difference]: Start difference. First operand 564 states and 928 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:21:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:47,556 INFO L93 Difference]: Finished difference Result 1496 states and 2519 transitions. [2024-10-12 19:21:47,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:21:47,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-12 19:21:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:47,564 INFO L225 Difference]: With dead ends: 1496 [2024-10-12 19:21:47,564 INFO L226 Difference]: Without dead ends: 1009 [2024-10-12 19:21:47,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:21:47,567 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 823 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:47,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1636 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:21:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-12 19:21:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 994. [2024-10-12 19:21:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 777 states have (on average 1.6537966537966537) internal successors, (1285), 810 states have internal predecessors, (1285), 168 states have call successors, (168), 43 states have call predecessors, (168), 48 states have return successors, (194), 166 states have call predecessors, (194), 163 states have call successors, (194) [2024-10-12 19:21:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1647 transitions. [2024-10-12 19:21:47,740 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1647 transitions. Word has length 95 [2024-10-12 19:21:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:47,741 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1647 transitions. [2024-10-12 19:21:47,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:21:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1647 transitions. [2024-10-12 19:21:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 19:21:47,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:47,743 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:47,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:21:47,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:21:47,944 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:47,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2055199571, now seen corresponding path program 1 times [2024-10-12 19:21:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:47,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391360515] [2024-10-12 19:21:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:21:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:21:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:21:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:21:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:21:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:21:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:21:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:21:48,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391360515] [2024-10-12 19:21:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391360515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:48,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:21:48,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909323980] [2024-10-12 19:21:48,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:48,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:21:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:48,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:21:48,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:21:48,380 INFO L87 Difference]: Start difference. First operand 994 states and 1647 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:21:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:51,819 INFO L93 Difference]: Finished difference Result 2332 states and 3954 transitions. [2024-10-12 19:21:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:21:51,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2024-10-12 19:21:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:51,827 INFO L225 Difference]: With dead ends: 2332 [2024-10-12 19:21:51,827 INFO L226 Difference]: Without dead ends: 1394 [2024-10-12 19:21:51,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:21:51,830 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1008 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 2926 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:51,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1526 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2926 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 19:21:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-10-12 19:21:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1032. [2024-10-12 19:21:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 809 states have (on average 1.6514215080346106) internal successors, (1336), 842 states have internal predecessors, (1336), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-12 19:21:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1709 transitions. [2024-10-12 19:21:52,016 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1709 transitions. Word has length 96 [2024-10-12 19:21:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:52,016 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1709 transitions. [2024-10-12 19:21:52,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:21:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1709 transitions. [2024-10-12 19:21:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 19:21:52,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:52,019 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:52,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:21:52,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:52,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash 395601334, now seen corresponding path program 1 times [2024-10-12 19:21:52,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:52,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049661917] [2024-10-12 19:21:52,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:52,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:21:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:21:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:21:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:21:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:21:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:21:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:21:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:21:52,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:52,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049661917] [2024-10-12 19:21:52,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049661917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:52,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:52,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:21:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540711286] [2024-10-12 19:21:52,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:52,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:21:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:52,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:21:52,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:21:52,502 INFO L87 Difference]: Start difference. First operand 1032 states and 1709 transitions. Second operand has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:21:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:21:56,950 INFO L93 Difference]: Finished difference Result 2350 states and 3979 transitions. [2024-10-12 19:21:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:21:56,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2024-10-12 19:21:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:21:56,958 INFO L225 Difference]: With dead ends: 2350 [2024-10-12 19:21:56,958 INFO L226 Difference]: Without dead ends: 1388 [2024-10-12 19:21:56,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:21:56,961 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1895 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 5053 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1968 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 5549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 5053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:21:56,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1968 Valid, 2615 Invalid, 5549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 5053 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 19:21:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-12 19:21:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1032. [2024-10-12 19:21:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 809 states have (on average 1.650185414091471) internal successors, (1335), 842 states have internal predecessors, (1335), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-12 19:21:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1708 transitions. [2024-10-12 19:21:57,155 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1708 transitions. Word has length 97 [2024-10-12 19:21:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:21:57,156 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1708 transitions. [2024-10-12 19:21:57,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:21:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1708 transitions. [2024-10-12 19:21:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 19:21:57,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:21:57,158 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:21:57,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:21:57,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:21:57,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:21:57,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1024998102, now seen corresponding path program 1 times [2024-10-12 19:21:57,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:21:57,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528794541] [2024-10-12 19:21:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:21:57,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:21:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:21:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:21:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:21:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:21:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:21:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:21:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:21:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:21:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:21:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:21:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:21:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:21:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:21:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528794541] [2024-10-12 19:21:57,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528794541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:21:57,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:21:57,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:21:57,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821739502] [2024-10-12 19:21:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:21:57,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:21:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:21:57,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:21:57,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:21:57,587 INFO L87 Difference]: Start difference. First operand 1032 states and 1708 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:22:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:01,030 INFO L93 Difference]: Finished difference Result 2370 states and 4012 transitions. [2024-10-12 19:22:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:22:01,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 97 [2024-10-12 19:22:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:01,038 INFO L225 Difference]: With dead ends: 2370 [2024-10-12 19:22:01,038 INFO L226 Difference]: Without dead ends: 1394 [2024-10-12 19:22:01,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:22:01,041 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 1007 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 3108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:01,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1543 Invalid, 3108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 19:22:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-10-12 19:22:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1032. [2024-10-12 19:22:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 809 states have (on average 1.6440049443757725) internal successors, (1330), 842 states have internal predecessors, (1330), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-12 19:22:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1703 transitions. [2024-10-12 19:22:01,235 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1703 transitions. Word has length 97 [2024-10-12 19:22:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:01,235 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1703 transitions. [2024-10-12 19:22:01,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:22:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1703 transitions. [2024-10-12 19:22:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 19:22:01,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:01,237 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:22:01,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:22:01,238 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:01,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 52320778, now seen corresponding path program 1 times [2024-10-12 19:22:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:01,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591904848] [2024-10-12 19:22:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:01,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:22:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:22:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:22:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:22:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:22:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:22:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:22:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:22:01,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:01,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591904848] [2024-10-12 19:22:01,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591904848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:01,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:01,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:22:01,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59852556] [2024-10-12 19:22:01,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:01,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:22:01,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:22:01,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:22:01,624 INFO L87 Difference]: Start difference. First operand 1032 states and 1703 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:22:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:04,785 INFO L93 Difference]: Finished difference Result 2354 states and 3978 transitions. [2024-10-12 19:22:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:22:04,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-12 19:22:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:04,792 INFO L225 Difference]: With dead ends: 2354 [2024-10-12 19:22:04,792 INFO L226 Difference]: Without dead ends: 1390 [2024-10-12 19:22:04,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:22:04,795 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1893 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:04,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1965 Valid, 1435 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 19:22:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-10-12 19:22:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1035. [2024-10-12 19:22:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 812 states have (on average 1.6403940886699508) internal successors, (1332), 845 states have internal predecessors, (1332), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-12 19:22:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1705 transitions. [2024-10-12 19:22:04,991 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1705 transitions. Word has length 98 [2024-10-12 19:22:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:04,991 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1705 transitions. [2024-10-12 19:22:04,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:22:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1705 transitions. [2024-10-12 19:22:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 19:22:04,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:04,993 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:22:04,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:22:04,994 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:04,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1024013144, now seen corresponding path program 1 times [2024-10-12 19:22:04,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:04,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166725942] [2024-10-12 19:22:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:04,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:22:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:22:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:22:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:22:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:22:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:22:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:22:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:22:05,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:05,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166725942] [2024-10-12 19:22:05,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166725942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:05,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:22:05,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705171838] [2024-10-12 19:22:05,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:05,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:22:05,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:05,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:22:05,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:22:05,382 INFO L87 Difference]: Start difference. First operand 1035 states and 1705 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:22:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:08,434 INFO L93 Difference]: Finished difference Result 2379 states and 4012 transitions. [2024-10-12 19:22:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:22:08,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-12 19:22:08,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:08,441 INFO L225 Difference]: With dead ends: 2379 [2024-10-12 19:22:08,441 INFO L226 Difference]: Without dead ends: 1400 [2024-10-12 19:22:08,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:22:08,445 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1920 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:08,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 1435 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 2648 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 19:22:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-10-12 19:22:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1035. [2024-10-12 19:22:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 812 states have (on average 1.6342364532019704) internal successors, (1327), 845 states have internal predecessors, (1327), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-12 19:22:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1700 transitions. [2024-10-12 19:22:08,660 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1700 transitions. Word has length 98 [2024-10-12 19:22:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:08,660 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1700 transitions. [2024-10-12 19:22:08,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:22:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1700 transitions. [2024-10-12 19:22:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 19:22:08,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:08,663 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:22:08,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:22:08,663 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:08,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:08,663 INFO L85 PathProgramCache]: Analyzing trace with hash 218615249, now seen corresponding path program 1 times [2024-10-12 19:22:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:08,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082485816] [2024-10-12 19:22:08,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:08,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:08,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:08,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:08,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:22:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:09,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:22:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:09,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:22:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:22:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:09,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:22:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:09,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:22:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:09,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:22:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:22:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082485816] [2024-10-12 19:22:09,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082485816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:09,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:09,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:22:09,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68522511] [2024-10-12 19:22:09,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:09,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:22:09,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:09,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:22:09,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:22:09,068 INFO L87 Difference]: Start difference. First operand 1035 states and 1700 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:22:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:12,312 INFO L93 Difference]: Finished difference Result 2362 states and 3979 transitions. [2024-10-12 19:22:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:22:12,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-12 19:22:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:12,324 INFO L225 Difference]: With dead ends: 2362 [2024-10-12 19:22:12,325 INFO L226 Difference]: Without dead ends: 1398 [2024-10-12 19:22:12,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:22:12,329 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 1883 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:12,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 1441 Invalid, 3106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2617 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 19:22:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-12 19:22:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1039. [2024-10-12 19:22:12,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 816 states have (on average 1.6299019607843137) internal successors, (1330), 849 states have internal predecessors, (1330), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-12 19:22:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1703 transitions. [2024-10-12 19:22:12,515 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1703 transitions. Word has length 99 [2024-10-12 19:22:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:12,515 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1703 transitions. [2024-10-12 19:22:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:22:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1703 transitions. [2024-10-12 19:22:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 19:22:12,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:12,517 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:22:12,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:22:12,518 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:12,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:12,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1130256369, now seen corresponding path program 1 times [2024-10-12 19:22:12,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:12,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423527115] [2024-10-12 19:22:12,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:12,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:22:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:22:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:22:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:22:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:22:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:22:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:22:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:22:12,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:12,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423527115] [2024-10-12 19:22:12,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423527115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:12,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:12,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:22:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649687001] [2024-10-12 19:22:12,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:12,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:22:12,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:12,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:22:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:22:12,930 INFO L87 Difference]: Start difference. First operand 1039 states and 1703 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:22:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:16,266 INFO L93 Difference]: Finished difference Result 2417 states and 4042 transitions. [2024-10-12 19:22:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:22:16,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-12 19:22:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:16,273 INFO L225 Difference]: With dead ends: 2417 [2024-10-12 19:22:16,273 INFO L226 Difference]: Without dead ends: 1372 [2024-10-12 19:22:16,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:22:16,276 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 923 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 3076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:16,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1548 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2878 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 19:22:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-10-12 19:22:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1021. [2024-10-12 19:22:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 801 states have (on average 1.634207240948814) internal successors, (1309), 832 states have internal predecessors, (1309), 171 states have call successors, (171), 43 states have call predecessors, (171), 48 states have return successors, (198), 169 states have call predecessors, (198), 166 states have call successors, (198) [2024-10-12 19:22:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1678 transitions. [2024-10-12 19:22:16,477 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1678 transitions. Word has length 99 [2024-10-12 19:22:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:16,477 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1678 transitions. [2024-10-12 19:22:16,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:22:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1678 transitions. [2024-10-12 19:22:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 19:22:16,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:16,479 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:22:16,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:22:16,480 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:16,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -998133627, now seen corresponding path program 1 times [2024-10-12 19:22:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:16,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490900414] [2024-10-12 19:22:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:16,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:22:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:22:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:22:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:22:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:22:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:22:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:22:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:22:16,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:16,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490900414] [2024-10-12 19:22:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490900414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:16,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:22:16,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323318807] [2024-10-12 19:22:16,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:16,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:22:16,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:16,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:22:16,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:22:16,889 INFO L87 Difference]: Start difference. First operand 1021 states and 1678 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:22:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:22:21,385 INFO L93 Difference]: Finished difference Result 2344 states and 3947 transitions. [2024-10-12 19:22:21,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:22:21,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2024-10-12 19:22:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:22:21,392 INFO L225 Difference]: With dead ends: 2344 [2024-10-12 19:22:21,393 INFO L226 Difference]: Without dead ends: 1382 [2024-10-12 19:22:21,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:22:21,411 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 947 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 5119 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 5322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 5119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:22:21,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 2733 Invalid, 5322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 5119 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 19:22:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-10-12 19:22:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1026. [2024-10-12 19:22:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 806 states have (on average 1.630272952853598) internal successors, (1314), 837 states have internal predecessors, (1314), 171 states have call successors, (171), 43 states have call predecessors, (171), 48 states have return successors, (198), 169 states have call predecessors, (198), 166 states have call successors, (198) [2024-10-12 19:22:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1683 transitions. [2024-10-12 19:22:21,601 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1683 transitions. Word has length 100 [2024-10-12 19:22:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:22:21,602 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1683 transitions. [2024-10-12 19:22:21,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:22:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1683 transitions. [2024-10-12 19:22:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 19:22:21,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:22:21,603 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:22:21,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:22:21,604 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:22:21,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:22:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1711990236, now seen corresponding path program 1 times [2024-10-12 19:22:21,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:22:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471017267] [2024-10-12 19:22:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:22:21,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:22:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:21,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:21,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:21,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:22:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:21,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:22:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:21,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:22:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:22:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:22,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:22:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:22:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:22:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:22,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:22:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:22:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:22:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:22:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:22:22,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:22:22,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471017267] [2024-10-12 19:22:22,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471017267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:22:22,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:22:22,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 19:22:22,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560848727] [2024-10-12 19:22:22,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:22:22,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:22:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:22:22,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:22:22,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:22:22,090 INFO L87 Difference]: Start difference. First operand 1026 states and 1683 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12)