./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_spec3_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb2818f0d8bce3a3c55c338823c603b0097898f29d2ecfaf46bb61225da928d8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:38:26,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:38:26,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:38:26,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:38:26,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:38:26,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:38:26,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:38:26,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:38:26,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:38:26,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:38:26,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:38:26,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:38:26,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:38:26,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:38:26,754 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:38:26,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:38:26,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:38:26,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:38:26,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:38:26,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:38:26,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:38:26,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:38:26,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:38:26,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:38:26,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:38:26,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:38:26,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:38:26,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:38:26,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:38:26,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:38:26,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:38:26,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:38:26,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:38:26,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:38:26,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:38:26,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:38:26,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:38:26,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:38:26,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:38:26,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:38:26,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:38:26,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:38:26,766 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb2818f0d8bce3a3c55c338823c603b0097898f29d2ecfaf46bb61225da928d8 [2024-10-11 02:38:26,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:38:26,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:38:26,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:38:26,985 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:38:26,985 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:38:26,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c [2024-10-11 02:38:28,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:38:28,649 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:38:28,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product28.cil.c [2024-10-11 02:38:28,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/147819fb7/f86d3346c6594eb795ce6594ee73658d/FLAG3c13d795b [2024-10-11 02:38:28,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/147819fb7/f86d3346c6594eb795ce6594ee73658d [2024-10-11 02:38:28,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:38:28,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:38:28,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:38:28,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:38:28,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:38:28,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:38:28" (1/1) ... [2024-10-11 02:38:28,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78751408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:28, skipping insertion in model container [2024-10-11 02:38:28,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:38:28" (1/1) ... [2024-10-11 02:38:28,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:38:29,167 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_spec3_product28.cil.c[73221,73234] [2024-10-11 02:38:29,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:38:29,183 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:38:29,190 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [48] [2024-10-11 02:38:29,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [242] [2024-10-11 02:38:29,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1847] [2024-10-11 02:38:29,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2213] [2024-10-11 02:38:29,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2231] [2024-10-11 02:38:29,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2350] [2024-10-11 02:38:29,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2703] [2024-10-11 02:38:29,194 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3364] [2024-10-11 02:38:29,194 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3455] [2024-10-11 02:38:29,194 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3464] [2024-10-11 02:38:29,287 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_spec3_product28.cil.c[73221,73234] [2024-10-11 02:38:29,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:38:29,318 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:38:29,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29 WrapperNode [2024-10-11 02:38:29,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:38:29,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:38:29,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:38:29,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:38:29,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,396 INFO L138 Inliner]: procedures = 95, calls = 354, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 1155 [2024-10-11 02:38:29,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:38:29,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:38:29,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:38:29,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:38:29,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,472 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-11 02:38:29,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:38:29,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:38:29,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:38:29,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:38:29,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (1/1) ... [2024-10-11 02:38:29,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:38:29,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:38:29,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:38:29,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:38:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:38:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-11 02:38:29,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-11 02:38:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:38:29,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:38:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:38:29,640 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:38:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-11 02:38:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-11 02:38:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:38:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:38:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:38:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:38:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:38:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:38:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:38:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:38:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:38:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:38:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:38:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:38:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:38:29,642 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:38:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:38:29,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:38:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:38:29,642 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:38:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:38:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:38:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-11 02:38:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-11 02:38:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:38:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:38:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-11 02:38:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-11 02:38:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:38:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:38:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-11 02:38:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-11 02:38:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:38:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:38:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:38:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:38:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:38:29,645 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:38:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:38:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:38:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:38:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:38:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:38:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:38:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:38:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:38:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:38:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:38:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:38:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:38:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:38:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:38:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:38:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:38:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:38:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:38:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:38:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:38:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:38:29,647 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:38:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:38:29,647 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:38:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:38:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:38:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:38:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:38:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:38:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:38:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:38:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:38:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-11 02:38:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-11 02:38:29,808 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:38:29,810 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:38:30,792 INFO L? ?]: Removed 473 outVars from TransFormulas that were not future-live. [2024-10-11 02:38:30,792 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:38:30,929 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:38:30,933 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:38:30,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:38:30 BoogieIcfgContainer [2024-10-11 02:38:30,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:38:30,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:38:30,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:38:30,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:38:30,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:38:28" (1/3) ... [2024-10-11 02:38:30,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cb154a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:38:30, skipping insertion in model container [2024-10-11 02:38:30,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:29" (2/3) ... [2024-10-11 02:38:30,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cb154a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:38:30, skipping insertion in model container [2024-10-11 02:38:30,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:38:30" (3/3) ... [2024-10-11 02:38:30,942 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product28.cil.c [2024-10-11 02:38:30,959 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:38:30,959 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:38:31,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:38:31,039 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;@1c8db891, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:38:31,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:38:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 583 states, 443 states have (on average 1.7020316027088036) internal successors, (754), 463 states have internal predecessors, (754), 110 states have call successors, (110), 28 states have call predecessors, (110), 28 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-11 02:38:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:38:31,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:31,063 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] [2024-10-11 02:38:31,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:31,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -434223233, now seen corresponding path program 1 times [2024-10-11 02:38:31,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:31,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482896328] [2024-10-11 02:38:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:32,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:32,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:32,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:32,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:38:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:32,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:38:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:32,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:38:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:32,393 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-11 02:38:32,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:32,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482896328] [2024-10-11 02:38:32,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482896328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:32,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:32,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:32,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269319696] [2024-10-11 02:38:32,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:32,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:32,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:32,454 INFO L87 Difference]: Start difference. First operand has 583 states, 443 states have (on average 1.7020316027088036) internal successors, (754), 463 states have internal predecessors, (754), 110 states have call successors, (110), 28 states have call predecessors, (110), 28 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:40,531 INFO L93 Difference]: Finished difference Result 1441 states and 2503 transitions. [2024-10-11 02:38:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:40,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 56 [2024-10-11 02:38:40,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:40,562 INFO L225 Difference]: With dead ends: 1441 [2024-10-11 02:38:40,563 INFO L226 Difference]: Without dead ends: 859 [2024-10-11 02:38:40,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:38:40,577 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 914 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 5344 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 5544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 5344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:40,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 2221 Invalid, 5544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [200 Valid, 5344 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-11 02:38:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-10-11 02:38:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 589. [2024-10-11 02:38:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 449 states have (on average 1.688195991091314) internal successors, (758), 469 states have internal predecessors, (758), 111 states have call successors, (111), 28 states have call predecessors, (111), 28 states have return successors, (110), 105 states have call predecessors, (110), 108 states have call successors, (110) [2024-10-11 02:38:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 979 transitions. [2024-10-11 02:38:40,792 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 979 transitions. Word has length 56 [2024-10-11 02:38:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:40,793 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 979 transitions. [2024-10-11 02:38:40,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 979 transitions. [2024-10-11 02:38:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:38:40,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:40,798 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] [2024-10-11 02:38:40,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:38:40,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:40,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash -322578571, now seen corresponding path program 1 times [2024-10-11 02:38:40,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:40,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055684632] [2024-10-11 02:38:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:38:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:38:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:38:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,588 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-11 02:38:41,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:41,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055684632] [2024-10-11 02:38:41,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055684632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:41,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:41,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416261539] [2024-10-11 02:38:41,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:41,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:41,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:41,594 INFO L87 Difference]: Start difference. First operand 589 states and 979 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:48,434 INFO L93 Difference]: Finished difference Result 1438 states and 2470 transitions. [2024-10-11 02:38:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:38:48,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2024-10-11 02:38:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:48,440 INFO L225 Difference]: With dead ends: 1438 [2024-10-11 02:38:48,440 INFO L226 Difference]: Without dead ends: 859 [2024-10-11 02:38:48,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:38:48,444 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1489 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 5142 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 5581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 5142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:48,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 2091 Invalid, 5581 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [439 Valid, 5142 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-11 02:38:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-10-11 02:38:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 589. [2024-10-11 02:38:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 449 states have (on average 1.6859688195991092) internal successors, (757), 469 states have internal predecessors, (757), 111 states have call successors, (111), 28 states have call predecessors, (111), 28 states have return successors, (110), 105 states have call predecessors, (110), 108 states have call successors, (110) [2024-10-11 02:38:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 978 transitions. [2024-10-11 02:38:48,526 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 978 transitions. Word has length 57 [2024-10-11 02:38:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:48,526 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 978 transitions. [2024-10-11 02:38:48,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:38:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 978 transitions. [2024-10-11 02:38:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:38:48,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:48,528 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] [2024-10-11 02:38:48,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:38:48,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:48,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1461948787, now seen corresponding path program 1 times [2024-10-11 02:38:48,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:48,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889889291] [2024-10-11 02:38:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:48,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:48,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:38:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:49,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:38:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:49,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:38:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:49,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:38:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:49,017 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-11 02:38:49,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:49,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889889291] [2024-10-11 02:38:49,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889889291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:49,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:49,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:38:49,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665561441] [2024-10-11 02:38:49,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:49,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:38:49,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:49,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:38:49,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:38:49,021 INFO L87 Difference]: Start difference. First operand 589 states and 978 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:38:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:54,602 INFO L93 Difference]: Finished difference Result 1432 states and 2453 transitions. [2024-10-11 02:38:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:38:54,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-10-11 02:38:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:54,612 INFO L225 Difference]: With dead ends: 1432 [2024-10-11 02:38:54,613 INFO L226 Difference]: Without dead ends: 824 [2024-10-11 02:38:54,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:54,616 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1435 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:54,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 1168 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 02:38:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-11 02:38:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 566. [2024-10-11 02:38:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 429 states have (on average 1.675990675990676) internal successors, (719), 447 states have internal predecessors, (719), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-11 02:38:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 936 transitions. [2024-10-11 02:38:54,720 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 936 transitions. Word has length 57 [2024-10-11 02:38:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:54,721 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 936 transitions. [2024-10-11 02:38:54,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:38:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 936 transitions. [2024-10-11 02:38:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:38:54,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:54,722 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] [2024-10-11 02:38:54,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:38:54,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:54,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1832204659, now seen corresponding path program 1 times [2024-10-11 02:38:54,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:54,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581814544] [2024-10-11 02:38:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:55,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:55,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:55,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:55,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:38:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:38:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:55,463 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-11 02:38:55,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:55,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581814544] [2024-10-11 02:38:55,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581814544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:55,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:55,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:55,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863446598] [2024-10-11 02:38:55,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:55,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:55,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:55,466 INFO L87 Difference]: Start difference. First operand 566 states and 936 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:01,874 INFO L93 Difference]: Finished difference Result 1396 states and 2385 transitions. [2024-10-11 02:39:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:39:01,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2024-10-11 02:39:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:01,879 INFO L225 Difference]: With dead ends: 1396 [2024-10-11 02:39:01,879 INFO L226 Difference]: Without dead ends: 818 [2024-10-11 02:39:01,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:39:01,882 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 1463 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 4977 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 5410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 4977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:01,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 2102 Invalid, 5410 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [433 Valid, 4977 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-11 02:39:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-11 02:39:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 560. [2024-10-11 02:39:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 423 states have (on average 1.66903073286052) internal successors, (706), 441 states have internal predecessors, (706), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-11 02:39:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 923 transitions. [2024-10-11 02:39:01,958 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 923 transitions. Word has length 58 [2024-10-11 02:39:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:01,959 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 923 transitions. [2024-10-11 02:39:01,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 923 transitions. [2024-10-11 02:39:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:39:01,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:01,960 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] [2024-10-11 02:39:01,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:39:01,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:01,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:01,961 INFO L85 PathProgramCache]: Analyzing trace with hash 735207949, now seen corresponding path program 1 times [2024-10-11 02:39:01,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:01,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214100863] [2024-10-11 02:39:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:39:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:39:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,476 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-11 02:39:02,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:02,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214100863] [2024-10-11 02:39:02,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214100863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:02,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:02,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:39:02,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378961967] [2024-10-11 02:39:02,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:02,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:39:02,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:02,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:39:02,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:02,479 INFO L87 Difference]: Start difference. First operand 560 states and 923 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:07,748 INFO L93 Difference]: Finished difference Result 1368 states and 2336 transitions. [2024-10-11 02:39:07,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:39:07,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2024-10-11 02:39:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:07,753 INFO L225 Difference]: With dead ends: 1368 [2024-10-11 02:39:07,753 INFO L226 Difference]: Without dead ends: 818 [2024-10-11 02:39:07,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:39:07,756 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 831 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 5030 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 5230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 5030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:07,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 2126 Invalid, 5230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 5030 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:39:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-11 02:39:07,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 560. [2024-10-11 02:39:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 423 states have (on average 1.6666666666666667) internal successors, (705), 441 states have internal predecessors, (705), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-11 02:39:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 922 transitions. [2024-10-11 02:39:07,819 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 922 transitions. Word has length 59 [2024-10-11 02:39:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:07,820 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 922 transitions. [2024-10-11 02:39:07,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 922 transitions. [2024-10-11 02:39:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:39:07,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:07,821 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] [2024-10-11 02:39:07,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:39:07,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:07,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1096341110, now seen corresponding path program 1 times [2024-10-11 02:39:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926610926] [2024-10-11 02:39:07,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:08,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:08,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:08,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:08,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:08,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:39:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:08,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:39:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:08,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:39:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:08,289 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-11 02:39:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926610926] [2024-10-11 02:39:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926610926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:08,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:08,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:39:08,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945681971] [2024-10-11 02:39:08,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:08,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:39:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:08,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:39:08,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:08,290 INFO L87 Difference]: Start difference. First operand 560 states and 922 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:13,919 INFO L93 Difference]: Finished difference Result 1384 states and 2354 transitions. [2024-10-11 02:39:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:39:13,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2024-10-11 02:39:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:13,926 INFO L225 Difference]: With dead ends: 1384 [2024-10-11 02:39:13,926 INFO L226 Difference]: Without dead ends: 812 [2024-10-11 02:39:13,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:39:13,930 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1432 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 4896 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 5323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 4896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:13,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 2096 Invalid, 5323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 4896 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 02:39:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-11 02:39:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 554. [2024-10-11 02:39:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.65947242206235) internal successors, (692), 435 states have internal predecessors, (692), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-11 02:39:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 909 transitions. [2024-10-11 02:39:14,024 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 909 transitions. Word has length 60 [2024-10-11 02:39:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:14,025 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 909 transitions. [2024-10-11 02:39:14,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 909 transitions. [2024-10-11 02:39:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:39:14,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:14,026 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] [2024-10-11 02:39:14,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:39:14,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:14,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2102953803, now seen corresponding path program 1 times [2024-10-11 02:39:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79412474] [2024-10-11 02:39:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:39:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:39:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:39:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,648 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-11 02:39:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79412474] [2024-10-11 02:39:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79412474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:14,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:14,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:39:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659075121] [2024-10-11 02:39:14,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:14,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:39:14,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:14,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:39:14,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:14,651 INFO L87 Difference]: Start difference. First operand 554 states and 909 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:20,294 INFO L93 Difference]: Finished difference Result 1356 states and 2307 transitions. [2024-10-11 02:39:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:39:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2024-10-11 02:39:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:20,303 INFO L225 Difference]: With dead ends: 1356 [2024-10-11 02:39:20,303 INFO L226 Difference]: Without dead ends: 812 [2024-10-11 02:39:20,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:39:20,307 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 811 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 4881 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 5081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 4881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:20,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 2110 Invalid, 5081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 4881 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:39:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-11 02:39:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 554. [2024-10-11 02:39:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.6570743405275778) internal successors, (691), 435 states have internal predecessors, (691), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-11 02:39:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 908 transitions. [2024-10-11 02:39:20,373 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 908 transitions. Word has length 61 [2024-10-11 02:39:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:20,373 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 908 transitions. [2024-10-11 02:39:20,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 908 transitions. [2024-10-11 02:39:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 02:39:20,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:20,374 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] [2024-10-11 02:39:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:39:20,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:20,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1379282323, now seen corresponding path program 1 times [2024-10-11 02:39:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374084960] [2024-10-11 02:39:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:39:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:39:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:39:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,800 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-11 02:39:20,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:20,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374084960] [2024-10-11 02:39:20,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374084960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:20,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:20,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:39:20,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565612651] [2024-10-11 02:39:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:20,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:39:20,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:20,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:39:20,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:20,802 INFO L87 Difference]: Start difference. First operand 554 states and 908 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:27,223 INFO L93 Difference]: Finished difference Result 1366 states and 2316 transitions. [2024-10-11 02:39:27,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:39:27,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-10-11 02:39:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:27,239 INFO L225 Difference]: With dead ends: 1366 [2024-10-11 02:39:27,240 INFO L226 Difference]: Without dead ends: 822 [2024-10-11 02:39:27,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:39:27,247 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 800 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 4927 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 5130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 4927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:27,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2088 Invalid, 5130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 4927 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-11 02:39:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-11 02:39:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 559. [2024-10-11 02:39:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 422 states have (on average 1.6492890995260663) internal successors, (696), 440 states have internal predecessors, (696), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-11 02:39:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 913 transitions. [2024-10-11 02:39:27,430 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 913 transitions. Word has length 62 [2024-10-11 02:39:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:27,430 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 913 transitions. [2024-10-11 02:39:27,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 913 transitions. [2024-10-11 02:39:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 02:39:27,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:27,432 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] [2024-10-11 02:39:27,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:39:27,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:27,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1159356946, now seen corresponding path program 1 times [2024-10-11 02:39:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:27,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099187795] [2024-10-11 02:39:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:27,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:28,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:28,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:28,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:28,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:39:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:28,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:39:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:28,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:39:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:28,239 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-11 02:39:28,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:28,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099187795] [2024-10-11 02:39:28,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099187795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:28,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:28,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:39:28,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536466417] [2024-10-11 02:39:28,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:28,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:39:28,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:28,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:39:28,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:28,248 INFO L87 Difference]: Start difference. First operand 559 states and 913 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:34,964 INFO L93 Difference]: Finished difference Result 1377 states and 2326 transitions. [2024-10-11 02:39:34,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:39:34,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-10-11 02:39:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:34,973 INFO L225 Difference]: With dead ends: 1377 [2024-10-11 02:39:34,977 INFO L226 Difference]: Without dead ends: 806 [2024-10-11 02:39:34,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:39:34,984 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 823 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 4924 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 5127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 4924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:34,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 2124 Invalid, 5127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 4924 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-11 02:39:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-11 02:39:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 548. [2024-10-11 02:39:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 411 states have (on average 1.6472019464720196) internal successors, (677), 429 states have internal predecessors, (677), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-11 02:39:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 894 transitions. [2024-10-11 02:39:35,157 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 894 transitions. Word has length 62 [2024-10-11 02:39:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:35,158 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 894 transitions. [2024-10-11 02:39:35,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 894 transitions. [2024-10-11 02:39:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 02:39:35,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:35,159 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] [2024-10-11 02:39:35,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:39:35,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:35,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1252795622, now seen corresponding path program 1 times [2024-10-11 02:39:35,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:35,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984541980] [2024-10-11 02:39:35,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:35,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:35,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:35,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:35,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:35,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:39:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:35,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:39:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:35,750 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-11 02:39:35,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984541980] [2024-10-11 02:39:35,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984541980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:35,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:35,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:39:35,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755182244] [2024-10-11 02:39:35,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:35,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:39:35,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:35,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:39:35,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:35,754 INFO L87 Difference]: Start difference. First operand 548 states and 894 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:41,086 INFO L93 Difference]: Finished difference Result 1350 states and 2282 transitions. [2024-10-11 02:39:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:39:41,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2024-10-11 02:39:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:41,090 INFO L225 Difference]: With dead ends: 1350 [2024-10-11 02:39:41,091 INFO L226 Difference]: Without dead ends: 812 [2024-10-11 02:39:41,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:39:41,093 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 1354 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 4687 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 5117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 4687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:41,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 2089 Invalid, 5117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 4687 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 02:39:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-11 02:39:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 554. [2024-10-11 02:39:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.6378896882494005) internal successors, (683), 435 states have internal predecessors, (683), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-11 02:39:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 900 transitions. [2024-10-11 02:39:41,176 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 900 transitions. Word has length 63 [2024-10-11 02:39:41,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:41,176 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 900 transitions. [2024-10-11 02:39:41,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 900 transitions. [2024-10-11 02:39:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 02:39:41,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:41,177 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] [2024-10-11 02:39:41,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:39:41,178 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:41,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -991187676, now seen corresponding path program 1 times [2024-10-11 02:39:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527144257] [2024-10-11 02:39:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:41,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:39:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:39:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,731 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-11 02:39:41,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527144257] [2024-10-11 02:39:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527144257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:41,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:41,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:39:41,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512750974] [2024-10-11 02:39:41,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:41,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:39:41,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:41,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:39:41,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:41,736 INFO L87 Difference]: Start difference. First operand 554 states and 900 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:48,435 INFO L93 Difference]: Finished difference Result 1358 states and 2288 transitions. [2024-10-11 02:39:48,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:39:48,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2024-10-11 02:39:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:48,441 INFO L225 Difference]: With dead ends: 1358 [2024-10-11 02:39:48,441 INFO L226 Difference]: Without dead ends: 806 [2024-10-11 02:39:48,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:39:48,443 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 795 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 4801 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 5004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 4801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:48,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 2130 Invalid, 5004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 4801 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 02:39:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-11 02:39:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 548. [2024-10-11 02:39:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 411 states have (on average 1.6447688564476886) internal successors, (676), 429 states have internal predecessors, (676), 110 states have call successors, (110), 28 states have call predecessors, (110), 26 states have return successors, (107), 104 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-11 02:39:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 893 transitions. [2024-10-11 02:39:48,526 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 893 transitions. Word has length 63 [2024-10-11 02:39:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:48,526 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 893 transitions. [2024-10-11 02:39:48,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:39:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 893 transitions. [2024-10-11 02:39:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 02:39:48,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:48,527 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] [2024-10-11 02:39:48,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:39:48,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:48,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash -550464659, now seen corresponding path program 1 times [2024-10-11 02:39:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:48,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010126066] [2024-10-11 02:39:48,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:48,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:39:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:39:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:39:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,981 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-11 02:39:48,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:48,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010126066] [2024-10-11 02:39:48,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010126066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:48,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:48,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:39:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749326219] [2024-10-11 02:39:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:48,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:39:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:48,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:39:48,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:39:48,983 INFO L87 Difference]: Start difference. First operand 548 states and 893 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 02:39:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:58,657 INFO L93 Difference]: Finished difference Result 2081 states and 3565 transitions. [2024-10-11 02:39:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:39:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 64 [2024-10-11 02:39:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:58,675 INFO L225 Difference]: With dead ends: 2081 [2024-10-11 02:39:58,675 INFO L226 Difference]: Without dead ends: 1545 [2024-10-11 02:39:58,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:39:58,681 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 2126 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 4666 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2267 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 5318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 4666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:58,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2267 Valid, 1955 Invalid, 5318 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [652 Valid, 4666 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-10-11 02:39:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-10-11 02:39:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1191. [2024-10-11 02:39:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 857 states have (on average 1.5927654609101516) internal successors, (1365), 911 states have internal predecessors, (1365), 277 states have call successors, (277), 53 states have call predecessors, (277), 56 states have return successors, (355), 269 states have call predecessors, (355), 273 states have call successors, (355) [2024-10-11 02:39:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1997 transitions. [2024-10-11 02:39:58,890 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1997 transitions. Word has length 64 [2024-10-11 02:39:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:58,890 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1997 transitions. [2024-10-11 02:39:58,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 02:39:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1997 transitions. [2024-10-11 02:39:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 02:39:58,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:58,891 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] [2024-10-11 02:39:58,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:39:58,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:58,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1804879763, now seen corresponding path program 1 times [2024-10-11 02:39:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:58,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524793618] [2024-10-11 02:39:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:59,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:59,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:59,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:59,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:59,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:39:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:59,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:39:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:59,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:39:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:59,585 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-11 02:39:59,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:59,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524793618] [2024-10-11 02:39:59,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524793618] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:39:59,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485138361] [2024-10-11 02:39:59,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:59,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:39:59,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:39:59,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:39:59,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:39:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:59,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 1473 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:39:59,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:39:59,899 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-11 02:39:59,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:39:59,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485138361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:59,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:39:59,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:39:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995986368] [2024-10-11 02:39:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:59,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:39:59,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:59,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:39:59,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:59,904 INFO L87 Difference]: Start difference. First operand 1191 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:40:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:00,491 INFO L93 Difference]: Finished difference Result 3457 states and 5881 transitions. [2024-10-11 02:40:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:40:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2024-10-11 02:40:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:00,506 INFO L225 Difference]: With dead ends: 3457 [2024-10-11 02:40:00,507 INFO L226 Difference]: Without dead ends: 2278 [2024-10-11 02:40:00,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:40:00,514 INFO L432 NwaCegarLoop]: 1556 mSDtfsCounter, 858 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:00,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 2336 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:40:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2024-10-11 02:40:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2220. [2024-10-11 02:40:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 1601 states have (on average 1.6058713304184884) internal successors, (2571), 1709 states have internal predecessors, (2571), 511 states have call successors, (511), 96 states have call predecessors, (511), 107 states have return successors, (680), 500 states have call predecessors, (680), 507 states have call successors, (680) [2024-10-11 02:40:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 3762 transitions. [2024-10-11 02:40:00,952 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 3762 transitions. Word has length 64 [2024-10-11 02:40:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:00,952 INFO L471 AbstractCegarLoop]: Abstraction has 2220 states and 3762 transitions. [2024-10-11 02:40:00,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:40:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3762 transitions. [2024-10-11 02:40:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 02:40:00,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:00,953 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] [2024-10-11 02:40:00,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:40:01,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 02:40:01,154 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:01,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash -767480758, now seen corresponding path program 1 times [2024-10-11 02:40:01,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:01,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282450551] [2024-10-11 02:40:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:40:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:40:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:40:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:40:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,693 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-11 02:40:01,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:01,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282450551] [2024-10-11 02:40:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282450551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:40:01,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792334195] [2024-10-11 02:40:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:01,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:40:01,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:40:01,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:40:01,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:40:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:40:01,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:40:01,960 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-11 02:40:01,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:40:01,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792334195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:01,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:40:01,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:40:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863156623] [2024-10-11 02:40:01,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:01,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:40:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:01,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:40:01,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:40:01,965 INFO L87 Difference]: Start difference. First operand 2220 states and 3762 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)