./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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_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-wip.fs.cvc5-61a6796-m [2024-10-14 02:49:26,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:49:26,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:49:26,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:49:26,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:49:26,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:49:26,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:49:26,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:49:26,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:49:26,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:49:26,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:49:26,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:49:26,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:49:26,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:49:26,495 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:49:26,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:49:26,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:49:26,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:49:26,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:49:26,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:49:26,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:49:26,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:49:26,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:49:26,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:49:26,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:49:26,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:49:26,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:49:26,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:49:26,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:49:26,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:49:26,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:49:26,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:49:26,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:49:26,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:49:26,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:49:26,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:49:26,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:49:26,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:49:26,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:49:26,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:49:26,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:49:26,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:49:26,501 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-14 02:49:26,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:49:26,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:49:26,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:49:26,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:49:26,732 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:49:26,733 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-14 02:49:27,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:49:28,121 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:49:28,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2024-10-14 02:49:28,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead9e8ac4/996119d0fd634e4b9fb6dc18b7bc19da/FLAGb0de71d6d [2024-10-14 02:49:28,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead9e8ac4/996119d0fd634e4b9fb6dc18b7bc19da [2024-10-14 02:49:28,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:49:28,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:49:28,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:49:28,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:49:28,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:49:28,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:49:28" (1/1) ... [2024-10-14 02:49:28,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72acbf53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:28, skipping insertion in model container [2024-10-14 02:49:28,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:49:28" (1/1) ... [2024-10-14 02:49:28,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:49:28,674 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-14 02:49:28,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:49:28,933 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:49:28,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-10-14 02:49:28,943 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [62] [2024-10-14 02:49:28,943 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [71] [2024-10-14 02:49:28,943 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [235] [2024-10-14 02:49:28,943 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [903] [2024-10-14 02:49:28,943 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1263] [2024-10-14 02:49:28,943 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1355] [2024-10-14 02:49:28,944 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1390] [2024-10-14 02:49:28,944 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1756] [2024-10-14 02:49:28,944 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3289] [2024-10-14 02:49:28,948 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-14 02:49:29,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:49:29,039 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:49:29,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29 WrapperNode [2024-10-14 02:49:29,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:49:29,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:49:29,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:49:29,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:49:29,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,107 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 863 [2024-10-14 02:49:29,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:49:29,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:49:29,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:49:29,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:49:29,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,149 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-14 02:49:29,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:49:29,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:49:29,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:49:29,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:49:29,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (1/1) ... [2024-10-14 02:49:29,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:49:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:49:29,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:49:29,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:49:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:49:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:49:29,334 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:49:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-14 02:49:29,334 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-14 02:49:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:49:29,334 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:49:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:49:29,335 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:49:29,335 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:49:29,335 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:49:29,335 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:49:29,335 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:49:29,335 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:49:29,335 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:49:29,335 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:49:29,335 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:49:29,335 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:49:29,335 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:49:29,336 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:49:29,336 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:49:29,336 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:49:29,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:49:29,336 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:49:29,336 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:49:29,336 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:49:29,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:49:29,336 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:49:29,338 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:49:29,338 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:49:29,338 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:49:29,338 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:49:29,338 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:49:29,338 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:49:29,338 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:49:29,338 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:49:29,338 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:49:29,338 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-10-14 02:49:29,339 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:49:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:49:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:49:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:49:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:49:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:49:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:49:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:49:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:49:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:49:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:49:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-14 02:49:29,342 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-14 02:49:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:49:29,342 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:49:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:49:29,342 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:49:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:49:29,342 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:49:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:49:29,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:49:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:49:29,343 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:49:29,513 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:49:29,515 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:49:30,455 INFO L? ?]: Removed 454 outVars from TransFormulas that were not future-live. [2024-10-14 02:49:30,455 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:49:30,515 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:49:30,517 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:49:30,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:49:30 BoogieIcfgContainer [2024-10-14 02:49:30,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:49:30,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:49:30,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:49:30,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:49:30,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:49:28" (1/3) ... [2024-10-14 02:49:30,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a83c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:49:30, skipping insertion in model container [2024-10-14 02:49:30,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:29" (2/3) ... [2024-10-14 02:49:30,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a83c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:49:30, skipping insertion in model container [2024-10-14 02:49:30,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:49:30" (3/3) ... [2024-10-14 02:49:30,525 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2024-10-14 02:49:30,537 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:49:30,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:49:30,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:49:30,604 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;@6f2bfb4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:49:30,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:49:30,609 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-14 02:49:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 02:49:30,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:30,626 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-14 02:49:30,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:30,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash -853912051, now seen corresponding path program 1 times [2024-10-14 02:49:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:30,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932362408] [2024-10-14 02:49:30,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:30,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:49:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:49:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:49:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:49:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:49:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:31,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:31,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932362408] [2024-10-14 02:49:31,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932362408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:31,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:31,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:49:31,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991615491] [2024-10-14 02:49:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:31,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:49:31,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:49:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:49:31,628 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-14 02:49:35,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:35,646 INFO L93 Difference]: Finished difference Result 1298 states and 2234 transitions. [2024-10-14 02:49:35,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:49:35,649 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-14 02:49:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:35,673 INFO L225 Difference]: With dead ends: 1298 [2024-10-14 02:49:35,674 INFO L226 Difference]: Without dead ends: 765 [2024-10-14 02:49:35,684 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-14 02:49:35,688 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1865 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 2808 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 3284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 2808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:35,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 1464 Invalid, 3284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 2808 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 02:49:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-14 02:49:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-14 02:49:35,857 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-14 02:49:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 906 transitions. [2024-10-14 02:49:35,862 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 906 transitions. Word has length 81 [2024-10-14 02:49:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:35,862 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 906 transitions. [2024-10-14 02:49:35,862 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-14 02:49:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 906 transitions. [2024-10-14 02:49:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 02:49:35,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:35,866 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-14 02:49:35,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:49:35,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:35,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:35,867 INFO L85 PathProgramCache]: Analyzing trace with hash -609393153, now seen corresponding path program 1 times [2024-10-14 02:49:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:35,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223230866] [2024-10-14 02:49:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:35,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:49:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:49:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:49:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:49:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:49:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:36,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:36,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223230866] [2024-10-14 02:49:36,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223230866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:36,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:36,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:49:36,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658529358] [2024-10-14 02:49:36,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:36,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:49:36,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:36,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:49:36,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:49:36,404 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-14 02:49:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:40,133 INFO L93 Difference]: Finished difference Result 1291 states and 2203 transitions. [2024-10-14 02:49:40,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:49:40,134 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-14 02:49:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:40,141 INFO L225 Difference]: With dead ends: 1291 [2024-10-14 02:49:40,141 INFO L226 Difference]: Without dead ends: 765 [2024-10-14 02:49:40,144 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-14 02:49:40,144 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 1403 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 335 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, 335 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:40,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1508 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2964 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:49:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-14 02:49:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-14 02:49:40,239 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-14 02:49:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 905 transitions. [2024-10-14 02:49:40,243 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 905 transitions. Word has length 83 [2024-10-14 02:49:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:40,244 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 905 transitions. [2024-10-14 02:49:40,244 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-14 02:49:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 905 transitions. [2024-10-14 02:49:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 02:49:40,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:40,247 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-14 02:49:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:49:40,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:40,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1835312252, now seen corresponding path program 1 times [2024-10-14 02:49:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764350904] [2024-10-14 02:49:40,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:40,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:49:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:49:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:49:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:49:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:49:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764350904] [2024-10-14 02:49:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764350904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:40,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:49:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819292406] [2024-10-14 02:49:40,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:40,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:49:40,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:40,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:49:40,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:49:40,709 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-14 02:49:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:43,970 INFO L93 Difference]: Finished difference Result 1291 states and 2202 transitions. [2024-10-14 02:49:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:49:43,971 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-14 02:49:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:43,975 INFO L225 Difference]: With dead ends: 1291 [2024-10-14 02:49:43,975 INFO L226 Difference]: Without dead ends: 765 [2024-10-14 02:49:43,977 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-14 02:49:43,977 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 1865 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 2787 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 2787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:43,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 1446 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 2787 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:49:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-14 02:49:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-14 02:49:44,051 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-14 02:49:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 904 transitions. [2024-10-14 02:49:44,053 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 904 transitions. Word has length 84 [2024-10-14 02:49:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:44,054 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 904 transitions. [2024-10-14 02:49:44,054 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-14 02:49:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 904 transitions. [2024-10-14 02:49:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 02:49:44,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:44,056 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-14 02:49:44,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:49:44,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:44,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash 452061979, now seen corresponding path program 1 times [2024-10-14 02:49:44,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:44,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819608651] [2024-10-14 02:49:44,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:44,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:49:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:49:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:49:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:49:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:49:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:49:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:44,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:44,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819608651] [2024-10-14 02:49:44,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819608651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:44,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:44,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:49:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121933003] [2024-10-14 02:49:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:44,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:49:44,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:44,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:49:44,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:49:44,532 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-14 02:49:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:47,828 INFO L93 Difference]: Finished difference Result 1291 states and 2201 transitions. [2024-10-14 02:49:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:49:47,829 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-14 02:49:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:47,832 INFO L225 Difference]: With dead ends: 1291 [2024-10-14 02:49:47,832 INFO L226 Difference]: Without dead ends: 765 [2024-10-14 02:49:47,834 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-14 02:49:47,835 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 1410 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:47,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1485 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:49:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-14 02:49:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-14 02:49:47,907 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-14 02:49:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 903 transitions. [2024-10-14 02:49:47,910 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 903 transitions. Word has length 85 [2024-10-14 02:49:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:47,910 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 903 transitions. [2024-10-14 02:49:47,911 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-14 02:49:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 903 transitions. [2024-10-14 02:49:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 02:49:47,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:47,913 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-14 02:49:47,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:49:47,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:47,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:47,913 INFO L85 PathProgramCache]: Analyzing trace with hash 661269976, now seen corresponding path program 1 times [2024-10-14 02:49:47,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:47,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037828676] [2024-10-14 02:49:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:47,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:49:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:49:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:49:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:49:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:49:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:49:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:49:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:48,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037828676] [2024-10-14 02:49:48,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037828676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:48,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:48,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 02:49:48,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044910972] [2024-10-14 02:49:48,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:48,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 02:49:48,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:48,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 02:49:48,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:49:48,524 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-14 02:49:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:54,456 INFO L93 Difference]: Finished difference Result 1300 states and 2222 transitions. [2024-10-14 02:49:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:49:54,457 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-14 02:49:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:54,461 INFO L225 Difference]: With dead ends: 1300 [2024-10-14 02:49:54,461 INFO L226 Difference]: Without dead ends: 774 [2024-10-14 02:49:54,463 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-14 02:49:54,464 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 969 mSDsluCounter, 3448 mSDsCounter, 0 mSdLazyCounter, 7904 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 3848 SdHoareTripleChecker+Invalid, 8114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 7904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:54,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 3848 Invalid, 8114 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [210 Valid, 7904 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-14 02:49:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-14 02:49:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 545. [2024-10-14 02:49:54,561 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-14 02:49:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 912 transitions. [2024-10-14 02:49:54,563 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 912 transitions. Word has length 86 [2024-10-14 02:49:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:54,563 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 912 transitions. [2024-10-14 02:49:54,564 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-14 02:49:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 912 transitions. [2024-10-14 02:49:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 02:49:54,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:54,568 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-14 02:49:54,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:49:54,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:54,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash -240309307, now seen corresponding path program 1 times [2024-10-14 02:49:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518881004] [2024-10-14 02:49:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:54,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:54,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:54,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:54,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:49:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:55,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:55,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:55,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:49:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:55,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 02:49:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:55,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:49:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:55,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:49:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:55,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:49:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:55,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518881004] [2024-10-14 02:49:55,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518881004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:55,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:55,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 02:49:55,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796425222] [2024-10-14 02:49:55,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:55,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:49:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:55,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:49:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:49:55,239 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-14 02:50:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:00,715 INFO L93 Difference]: Finished difference Result 1284 states and 2181 transitions. [2024-10-14 02:50:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:50:00,716 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-14 02:50:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:00,719 INFO L225 Difference]: With dead ends: 1284 [2024-10-14 02:50:00,720 INFO L226 Difference]: Without dead ends: 791 [2024-10-14 02:50:00,721 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-14 02:50:00,722 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1466 mSDsluCounter, 3072 mSDsCounter, 0 mSdLazyCounter, 7067 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:00,722 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.8s Time] [2024-10-14 02:50:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-10-14 02:50:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 546. [2024-10-14 02:50:00,798 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-14 02:50:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 908 transitions. [2024-10-14 02:50:00,801 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 908 transitions. Word has length 88 [2024-10-14 02:50:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:00,802 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 908 transitions. [2024-10-14 02:50:00,802 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-14 02:50:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 908 transitions. [2024-10-14 02:50:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 02:50:00,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:00,804 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-14 02:50:00,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:50:00,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash 748065232, now seen corresponding path program 1 times [2024-10-14 02:50:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:00,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044761602] [2024-10-14 02:50:00,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:00,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:50:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:50:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 02:50:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:50:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:50:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:50:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:50:01,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044761602] [2024-10-14 02:50:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044761602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:01,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:01,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:50:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474342937] [2024-10-14 02:50:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:01,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:50:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:50:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:50:01,339 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-14 02:50:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:05,581 INFO L93 Difference]: Finished difference Result 1282 states and 2170 transitions. [2024-10-14 02:50:05,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:50:05,581 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-14 02:50:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:05,585 INFO L225 Difference]: With dead ends: 1282 [2024-10-14 02:50:05,585 INFO L226 Difference]: Without dead ends: 788 [2024-10-14 02:50:05,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-10-14 02:50:05,587 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 1470 mSDsluCounter, 2242 mSDsCounter, 0 mSdLazyCounter, 5319 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 5670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 5319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:05,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 2640 Invalid, 5670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 5319 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 02:50:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-14 02:50:05,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 549. [2024-10-14 02:50:05,661 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-14 02:50:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 906 transitions. [2024-10-14 02:50:05,664 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 906 transitions. Word has length 89 [2024-10-14 02:50:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:05,665 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 906 transitions. [2024-10-14 02:50:05,665 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-14 02:50:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 906 transitions. [2024-10-14 02:50:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 02:50:05,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:05,667 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-14 02:50:05,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:50:05,667 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:05,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:05,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2134440608, now seen corresponding path program 1 times [2024-10-14 02:50:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:05,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358627809] [2024-10-14 02:50:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:05,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:06,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:50:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:06,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 02:50:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:50:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:50:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:50:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:06,270 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-14 02:50:06,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:06,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358627809] [2024-10-14 02:50:06,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358627809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:06,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:06,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 02:50:06,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090325393] [2024-10-14 02:50:06,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:06,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:50:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:50:06,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:50:06,272 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-14 02:50:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:11,713 INFO L93 Difference]: Finished difference Result 1301 states and 2201 transitions. [2024-10-14 02:50:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 02:50:11,713 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-14 02:50:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:11,718 INFO L225 Difference]: With dead ends: 1301 [2024-10-14 02:50:11,718 INFO L226 Difference]: Without dead ends: 812 [2024-10-14 02:50:11,721 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-14 02:50:11,722 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 1039 mSDsluCounter, 3107 mSDsCounter, 0 mSdLazyCounter, 7044 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 7258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 7044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:11,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 3516 Invalid, 7258 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [214 Valid, 7044 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-14 02:50:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-14 02:50:11,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 564. [2024-10-14 02:50:11,822 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-14 02:50:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 928 transitions. [2024-10-14 02:50:11,824 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 928 transitions. Word has length 92 [2024-10-14 02:50:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:11,825 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 928 transitions. [2024-10-14 02:50:11,825 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-14 02:50:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 928 transitions. [2024-10-14 02:50:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 02:50:11,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:11,827 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-14 02:50:11,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:50:11,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -601725165, now seen corresponding path program 1 times [2024-10-14 02:50:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961048196] [2024-10-14 02:50:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:11,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:11,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:11,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:50:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:50:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:50:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:50:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:50:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,404 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-14 02:50:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:12,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961048196] [2024-10-14 02:50:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961048196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:50:12,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376175648] [2024-10-14 02:50:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:12,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:50:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:50:12,406 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-14 02:50:12,407 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-14 02:50:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:12,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 02:50:12,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:50:12,663 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-14 02:50:12,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:50:12,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376175648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:12,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:50:12,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 14 [2024-10-14 02:50:12,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681918742] [2024-10-14 02:50:12,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:12,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:50:12,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:12,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:50:12,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:50:12,665 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-14 02:50:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:12,915 INFO L93 Difference]: Finished difference Result 1496 states and 2519 transitions. [2024-10-14 02:50:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:50:12,915 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-14 02:50:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:12,923 INFO L225 Difference]: With dead ends: 1496 [2024-10-14 02:50:12,923 INFO L226 Difference]: Without dead ends: 1009 [2024-10-14 02:50:12,926 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-14 02:50:12,926 INFO L432 NwaCegarLoop]: 934 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, 1635 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-14 02:50:12,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1635 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:50:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-14 02:50:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 994. [2024-10-14 02:50:13,074 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-14 02:50:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1647 transitions. [2024-10-14 02:50:13,091 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1647 transitions. Word has length 95 [2024-10-14 02:50:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:13,092 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1647 transitions. [2024-10-14 02:50:13,092 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-14 02:50:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1647 transitions. [2024-10-14 02:50:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:50:13,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:13,094 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-14 02:50:13,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 02:50:13,298 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-14 02:50:13,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:13,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:13,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2055199571, now seen corresponding path program 1 times [2024-10-14 02:50:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:13,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531920726] [2024-10-14 02:50:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:13,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:50:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:50:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:50:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:50:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:50:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,772 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-14 02:50:13,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:13,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531920726] [2024-10-14 02:50:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531920726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:13,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:13,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802888548] [2024-10-14 02:50:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:13,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:13,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:13,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:13,774 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-14 02:50:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:17,252 INFO L93 Difference]: Finished difference Result 2332 states and 3954 transitions. [2024-10-14 02:50:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:50:17,253 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-14 02:50:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:17,260 INFO L225 Difference]: With dead ends: 2332 [2024-10-14 02:50:17,260 INFO L226 Difference]: Without dead ends: 1394 [2024-10-14 02:50:17,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:50:17,263 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1008 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 2930 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 3139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:17,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1526 Invalid, 3139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2930 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 02:50:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-10-14 02:50:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1032. [2024-10-14 02:50:17,426 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-14 02:50:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1709 transitions. [2024-10-14 02:50:17,434 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1709 transitions. Word has length 96 [2024-10-14 02:50:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:17,434 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1709 transitions. [2024-10-14 02:50:17,434 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-14 02:50:17,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1709 transitions. [2024-10-14 02:50:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 02:50:17,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:17,436 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-14 02:50:17,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:50:17,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:17,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash 395601334, now seen corresponding path program 1 times [2024-10-14 02:50:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:17,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44381811] [2024-10-14 02:50:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:50:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:50:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:50:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:50:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:50:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,935 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-14 02:50:17,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44381811] [2024-10-14 02:50:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44381811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:17,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:50:17,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225542627] [2024-10-14 02:50:17,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:17,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:50:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:17,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:50:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:50:17,937 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-14 02:50:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:22,271 INFO L93 Difference]: Finished difference Result 2350 states and 3979 transitions. [2024-10-14 02:50:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:50:22,272 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-14 02:50:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:22,278 INFO L225 Difference]: With dead ends: 2350 [2024-10-14 02:50:22,279 INFO L226 Difference]: Without dead ends: 1388 [2024-10-14 02:50:22,281 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-14 02:50:22,282 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-14 02:50:22,282 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-14 02:50:22,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-14 02:50:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1032. [2024-10-14 02:50:22,469 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-14 02:50:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1708 transitions. [2024-10-14 02:50:22,474 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1708 transitions. Word has length 97 [2024-10-14 02:50:22,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:22,474 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1708 transitions. [2024-10-14 02:50:22,475 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-14 02:50:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1708 transitions. [2024-10-14 02:50:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 02:50:22,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:22,477 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-14 02:50:22,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:50:22,477 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:22,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1024998102, now seen corresponding path program 1 times [2024-10-14 02:50:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:22,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980610806] [2024-10-14 02:50:22,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:22,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:50:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:50:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:50:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:50:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:50:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:22,885 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-14 02:50:22,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:22,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980610806] [2024-10-14 02:50:22,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980610806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:22,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:22,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:22,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848617401] [2024-10-14 02:50:22,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:22,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:22,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:22,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:22,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:22,887 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-14 02:50:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:26,330 INFO L93 Difference]: Finished difference Result 2370 states and 4012 transitions. [2024-10-14 02:50:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:50:26,331 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-14 02:50:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:26,337 INFO L225 Difference]: With dead ends: 2370 [2024-10-14 02:50:26,337 INFO L226 Difference]: Without dead ends: 1394 [2024-10-14 02:50:26,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:50:26,340 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 1007 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:26,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1543 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 2898 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 02:50:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-10-14 02:50:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1032. [2024-10-14 02:50:26,511 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-14 02:50:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1703 transitions. [2024-10-14 02:50:26,515 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1703 transitions. Word has length 97 [2024-10-14 02:50:26,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:26,516 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1703 transitions. [2024-10-14 02:50:26,516 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-14 02:50:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1703 transitions. [2024-10-14 02:50:26,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 02:50:26,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:26,518 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-14 02:50:26,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:50:26,519 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:26,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:26,519 INFO L85 PathProgramCache]: Analyzing trace with hash 52320778, now seen corresponding path program 1 times [2024-10-14 02:50:26,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:26,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467692138] [2024-10-14 02:50:26,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:26,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:50:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:50:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:50:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:50:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:50:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:26,921 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-14 02:50:26,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:26,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467692138] [2024-10-14 02:50:26,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467692138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:26,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:26,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:26,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456230456] [2024-10-14 02:50:26,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:26,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:26,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:26,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:26,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:26,923 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-14 02:50:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:30,151 INFO L93 Difference]: Finished difference Result 2354 states and 3978 transitions. [2024-10-14 02:50:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:50:30,151 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-14 02:50:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:30,157 INFO L225 Difference]: With dead ends: 2354 [2024-10-14 02:50:30,157 INFO L226 Difference]: Without dead ends: 1390 [2024-10-14 02:50:30,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:50:30,160 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1893 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 3118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:30,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1965 Valid, 1435 Invalid, 3118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 2627 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:50:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-10-14 02:50:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1035. [2024-10-14 02:50:30,352 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-14 02:50:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1705 transitions. [2024-10-14 02:50:30,356 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1705 transitions. Word has length 98 [2024-10-14 02:50:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:30,356 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1705 transitions. [2024-10-14 02:50:30,356 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-14 02:50:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1705 transitions. [2024-10-14 02:50:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 02:50:30,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:30,359 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-14 02:50:30,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:50:30,359 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:30,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1024013144, now seen corresponding path program 1 times [2024-10-14 02:50:30,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:30,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824125851] [2024-10-14 02:50:30,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:30,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:50:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:50:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:50:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:50:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:50:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,738 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-14 02:50:30,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824125851] [2024-10-14 02:50:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824125851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:30,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308815714] [2024-10-14 02:50:30,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:30,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:30,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:30,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:30,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:30,740 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-14 02:50:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:33,784 INFO L93 Difference]: Finished difference Result 2379 states and 4012 transitions. [2024-10-14 02:50:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:50:33,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), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-14 02:50:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:33,791 INFO L225 Difference]: With dead ends: 2379 [2024-10-14 02:50:33,791 INFO L226 Difference]: Without dead ends: 1400 [2024-10-14 02:50:33,794 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-14 02:50:33,795 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1920 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 3148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:33,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 1435 Invalid, 3148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 2651 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:50:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-10-14 02:50:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1035. [2024-10-14 02:50:33,992 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-14 02:50:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1700 transitions. [2024-10-14 02:50:33,997 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1700 transitions. Word has length 98 [2024-10-14 02:50:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:33,997 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1700 transitions. [2024-10-14 02:50:33,997 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-14 02:50:33,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1700 transitions. [2024-10-14 02:50:33,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 02:50:33,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:34,000 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-14 02:50:34,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:50:34,000 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:34,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash 218615249, now seen corresponding path program 1 times [2024-10-14 02:50:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:34,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543439954] [2024-10-14 02:50:34,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:50:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:50:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:50:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:50:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:50:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,423 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-14 02:50:34,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543439954] [2024-10-14 02:50:34,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543439954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:34,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:34,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:34,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890197383] [2024-10-14 02:50:34,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:34,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:34,427 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-14 02:50:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:37,690 INFO L93 Difference]: Finished difference Result 2362 states and 3979 transitions. [2024-10-14 02:50:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:50:37,690 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-14 02:50:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:37,698 INFO L225 Difference]: With dead ends: 2362 [2024-10-14 02:50:37,698 INFO L226 Difference]: Without dead ends: 1398 [2024-10-14 02:50:37,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:50:37,701 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 1883 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:37,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 1441 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:50:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-14 02:50:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1039. [2024-10-14 02:50:37,904 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-14 02:50:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1703 transitions. [2024-10-14 02:50:37,908 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1703 transitions. Word has length 99 [2024-10-14 02:50:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:37,908 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1703 transitions. [2024-10-14 02:50:37,908 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-14 02:50:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1703 transitions. [2024-10-14 02:50:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 02:50:37,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:37,911 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-14 02:50:37,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 02:50:37,911 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:37,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1130256369, now seen corresponding path program 1 times [2024-10-14 02:50:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:37,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478850904] [2024-10-14 02:50:37,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:37,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:50:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:50:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:50:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:50:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:50:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,376 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-14 02:50:38,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:38,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478850904] [2024-10-14 02:50:38,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478850904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:38,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:38,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:50:38,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16588990] [2024-10-14 02:50:38,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:38,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:50:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:38,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:50:38,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:38,378 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-14 02:50:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:41,815 INFO L93 Difference]: Finished difference Result 2417 states and 4042 transitions. [2024-10-14 02:50:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:50:41,816 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-14 02:50:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:41,823 INFO L225 Difference]: With dead ends: 2417 [2024-10-14 02:50:41,823 INFO L226 Difference]: Without dead ends: 1372 [2024-10-14 02:50:41,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 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-14 02:50:41,826 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 923 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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-14 02:50:41,826 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-14 02:50:41,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-10-14 02:50:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1021. [2024-10-14 02:50:42,026 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-14 02:50:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1678 transitions. [2024-10-14 02:50:42,031 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1678 transitions. Word has length 99 [2024-10-14 02:50:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:42,031 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1678 transitions. [2024-10-14 02:50:42,031 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-14 02:50:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1678 transitions. [2024-10-14 02:50:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 02:50:42,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:42,032 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-14 02:50:42,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 02:50:42,033 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:42,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash -998133627, now seen corresponding path program 1 times [2024-10-14 02:50:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:42,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828038809] [2024-10-14 02:50:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:42,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:50:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:50:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:50:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:50:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:50:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,508 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-14 02:50:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:42,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828038809] [2024-10-14 02:50:42,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828038809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:42,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:42,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:50:42,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038926074] [2024-10-14 02:50:42,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:42,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:50:42,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:42,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:50:42,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:50:42,510 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-14 02:50:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:47,041 INFO L93 Difference]: Finished difference Result 2344 states and 3947 transitions. [2024-10-14 02:50:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:50:47,042 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-14 02:50:47,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:47,049 INFO L225 Difference]: With dead ends: 2344 [2024-10-14 02:50:47,049 INFO L226 Difference]: Without dead ends: 1382 [2024-10-14 02:50:47,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:50:47,052 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 947 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 5126 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 5329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 5126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:47,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 2733 Invalid, 5329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 5126 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 02:50:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-10-14 02:50:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1026. [2024-10-14 02:50:47,264 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-14 02:50:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1683 transitions. [2024-10-14 02:50:47,268 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1683 transitions. Word has length 100 [2024-10-14 02:50:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:47,269 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1683 transitions. [2024-10-14 02:50:47,269 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-14 02:50:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1683 transitions. [2024-10-14 02:50:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 02:50:47,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:47,271 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-14 02:50:47,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 02:50:47,271 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:47,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1711990236, now seen corresponding path program 1 times [2024-10-14 02:50:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:47,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378624001] [2024-10-14 02:50:47,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:50:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:50:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:50:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:50:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:50:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:50:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:50:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:47,777 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-14 02:50:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378624001] [2024-10-14 02:50:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378624001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:47,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 02:50:47,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814843504] [2024-10-14 02:50:47,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:47,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:50:47,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:47,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:50:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:50:47,779 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)