./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.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 b02d53de4cc8dbaebc187e8fa236234211af4eca5416c7869304d04f0d61a0bd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:35:11,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:35:11,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:35:11,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:35:11,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:35:11,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:35:11,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:35:11,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:35:11,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:35:11,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:35:11,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:35:11,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:35:11,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:35:11,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:35:11,637 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:35:11,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:35:11,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:35:11,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:35:11,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:35:11,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:35:11,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:35:11,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:35:11,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:35:11,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:35:11,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:35:11,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:35:11,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:35:11,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:35:11,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:35:11,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:35:11,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:35:11,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:35:11,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:35:11,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:35:11,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:35:11,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:35:11,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:35:11,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:35:11,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:35:11,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:35:11,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:35:11,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:35:11,648 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 -> b02d53de4cc8dbaebc187e8fa236234211af4eca5416c7869304d04f0d61a0bd [2024-10-11 02:35:11,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:35:11,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:35:11,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:35:11,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:35:11,925 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:35:11,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c [2024-10-11 02:35:13,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:35:13,918 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:35:13,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c [2024-10-11 02:35:13,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3b51ce149/1b5e9c97af5845bf9b27c7e12300bd6c/FLAGb918bb8d2 [2024-10-11 02:35:14,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3b51ce149/1b5e9c97af5845bf9b27c7e12300bd6c [2024-10-11 02:35:14,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:35:14,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:35:14,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:35:14,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:35:14,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:35:14,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:35:14" (1/1) ... [2024-10-11 02:35:14,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3800ca73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:14, skipping insertion in model container [2024-10-11 02:35:14,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:35:14" (1/1) ... [2024-10-11 02:35:14,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:35:15,031 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c[40071,40084] [2024-10-11 02:35:15,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:35:15,232 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:35:15,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-11 02:35:15,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [86] [2024-10-11 02:35:15,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [452] [2024-10-11 02:35:15,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1120] [2024-10-11 02:35:15,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1220] [2024-10-11 02:35:15,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1574] [2024-10-11 02:35:15,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1586] [2024-10-11 02:35:15,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [1706] [2024-10-11 02:35:15,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1890] [2024-10-11 02:35:15,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1899] [2024-10-11 02:35:15,385 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c[40071,40084] [2024-10-11 02:35:15,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:35:15,515 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:35:15,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15 WrapperNode [2024-10-11 02:35:15,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:35:15,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:35:15,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:35:15,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:35:15,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,630 INFO L138 Inliner]: procedures = 92, calls = 339, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 860 [2024-10-11 02:35:15,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:35:15,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:35:15,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:35:15,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:35:15,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,712 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-11 02:35:15,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:35:15,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:35:15,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:35:15,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:35:15,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (1/1) ... [2024-10-11 02:35:15,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:35:15,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:35:15,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:35:15,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:35:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:35:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:35:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:35:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:35:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:35:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:35:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:35:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:35:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:35:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:35:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:35:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:35:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:35:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:35:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:35:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:35:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:35:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:35:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:35:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:35:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:35:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:35:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:35:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:35:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:35:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:35:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:35:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:35:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:35:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:35:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:35:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:35:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:35:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:35:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:35:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:35:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:35:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:35:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:35:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:35:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:35:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:35:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:35:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:35:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:35:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:35:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:35:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:35:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:35:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:35:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:35:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:35:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:35:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:35:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:35:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:35:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:35:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:35:15,854 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:35:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:35:15,854 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:35:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:35:15,854 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:35:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:35:15,855 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:35:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:35:15,855 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:35:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:35:15,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:35:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:35:15,855 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:35:15,993 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:35:15,995 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:35:16,912 INFO L? ?]: Removed 448 outVars from TransFormulas that were not future-live. [2024-10-11 02:35:16,913 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:35:16,974 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:35:16,974 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:35:16,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:35:16 BoogieIcfgContainer [2024-10-11 02:35:16,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:35:16,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:35:16,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:35:16,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:35:16,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:35:14" (1/3) ... [2024-10-11 02:35:16,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ccd272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:35:16, skipping insertion in model container [2024-10-11 02:35:16,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:15" (2/3) ... [2024-10-11 02:35:16,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ccd272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:35:16, skipping insertion in model container [2024-10-11 02:35:16,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:35:16" (3/3) ... [2024-10-11 02:35:16,981 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product21.cil.c [2024-10-11 02:35:16,994 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:35:16,994 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:35:17,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:35:17,054 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;@15644a32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:35:17,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:35:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 542 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 442 states have internal predecessors, (728), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-11 02:35:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 02:35:17,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:17,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:17,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:17,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:17,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1538400726, now seen corresponding path program 1 times [2024-10-11 02:35:17,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:17,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374354468] [2024-10-11 02:35:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:17,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:17,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:17,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:35:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:18,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:35:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:18,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:18,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:35:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:18,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:35:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:18,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:35:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:18,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:35:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:18,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374354468] [2024-10-11 02:35:18,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374354468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:18,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:18,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029274861] [2024-10-11 02:35:18,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:18,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:18,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:18,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:18,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:18,203 INFO L87 Difference]: Start difference. First operand has 542 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 442 states have internal predecessors, (728), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:23,939 INFO L93 Difference]: Finished difference Result 1320 states and 2268 transitions. [2024-10-11 02:35:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2024-10-11 02:35:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:23,981 INFO L225 Difference]: With dead ends: 1320 [2024-10-11 02:35:23,982 INFO L226 Difference]: Without dead ends: 787 [2024-10-11 02:35:23,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:23,999 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1404 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 2843 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 3196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 2843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:24,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1669 Invalid, 3196 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [353 Valid, 2843 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:35:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-11 02:35:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 538. [2024-10-11 02:35:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.7183770883054892) internal successors, (720), 438 states have internal predecessors, (720), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 02:35:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 905 transitions. [2024-10-11 02:35:24,218 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 905 transitions. Word has length 79 [2024-10-11 02:35:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:24,219 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 905 transitions. [2024-10-11 02:35:24,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 905 transitions. [2024-10-11 02:35:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 02:35:24,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:24,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:24,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:35:24,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:24,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash 464240010, now seen corresponding path program 1 times [2024-10-11 02:35:24,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:24,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351422781] [2024-10-11 02:35:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:24,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:24,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:24,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:35:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:24,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:25,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:25,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:35:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:35:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:25,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:35:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:25,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:35:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:25,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351422781] [2024-10-11 02:35:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351422781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:25,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:25,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:25,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771027102] [2024-10-11 02:35:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:25,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:25,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:25,056 INFO L87 Difference]: Start difference. First operand 538 states and 905 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:30,753 INFO L93 Difference]: Finished difference Result 1313 states and 2237 transitions. [2024-10-11 02:35:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:30,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 81 [2024-10-11 02:35:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:30,761 INFO L225 Difference]: With dead ends: 1313 [2024-10-11 02:35:30,762 INFO L226 Difference]: Without dead ends: 787 [2024-10-11 02:35:30,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:30,765 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 956 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:30,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1723 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:35:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-11 02:35:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 538. [2024-10-11 02:35:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.7159904534606205) internal successors, (719), 438 states have internal predecessors, (719), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 02:35:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 904 transitions. [2024-10-11 02:35:30,895 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 904 transitions. Word has length 81 [2024-10-11 02:35:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:30,895 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 904 transitions. [2024-10-11 02:35:30,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 904 transitions. [2024-10-11 02:35:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 02:35:30,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:30,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:30,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:35:30,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:30,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1282449535, now seen corresponding path program 1 times [2024-10-11 02:35:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137575913] [2024-10-11 02:35:30,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:35:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:35:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:35:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:35:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:35:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:35:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:31,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:31,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137575913] [2024-10-11 02:35:31,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137575913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:31,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:31,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:31,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744920757] [2024-10-11 02:35:31,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:31,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:31,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:31,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:31,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:31,494 INFO L87 Difference]: Start difference. First operand 538 states and 904 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:36,739 INFO L93 Difference]: Finished difference Result 1313 states and 2236 transitions. [2024-10-11 02:35:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:36,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2024-10-11 02:35:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:36,749 INFO L225 Difference]: With dead ends: 1313 [2024-10-11 02:35:36,749 INFO L226 Difference]: Without dead ends: 787 [2024-10-11 02:35:36,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:36,755 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1392 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:36,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1659 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 2927 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:35:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-11 02:35:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 538. [2024-10-11 02:35:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.7136038186157518) internal successors, (718), 438 states have internal predecessors, (718), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 02:35:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 903 transitions. [2024-10-11 02:35:36,934 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 903 transitions. Word has length 82 [2024-10-11 02:35:36,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:36,934 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 903 transitions. [2024-10-11 02:35:36,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 903 transitions. [2024-10-11 02:35:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 02:35:36,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:36,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:36,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:35:36,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:36,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2115772186, now seen corresponding path program 1 times [2024-10-11 02:35:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:36,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512198284] [2024-10-11 02:35:36,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:36,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:37,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:37,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:35:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:35:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:37,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:38,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:38,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:35:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:38,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:35:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:38,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:35:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:38,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:35:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:38,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:38,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512198284] [2024-10-11 02:35:38,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512198284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:38,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:38,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:38,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16659289] [2024-10-11 02:35:38,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:38,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:38,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:38,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:38,076 INFO L87 Difference]: Start difference. First operand 538 states and 903 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:43,228 INFO L93 Difference]: Finished difference Result 1313 states and 2235 transitions. [2024-10-11 02:35:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:43,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2024-10-11 02:35:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:43,235 INFO L225 Difference]: With dead ends: 1313 [2024-10-11 02:35:43,236 INFO L226 Difference]: Without dead ends: 787 [2024-10-11 02:35:43,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:43,240 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 1385 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:43,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 1676 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 2931 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:35:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-11 02:35:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 538. [2024-10-11 02:35:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.7112171837708832) internal successors, (717), 438 states have internal predecessors, (717), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 02:35:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 902 transitions. [2024-10-11 02:35:43,353 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 902 transitions. Word has length 83 [2024-10-11 02:35:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:43,354 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 902 transitions. [2024-10-11 02:35:43,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 902 transitions. [2024-10-11 02:35:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 02:35:43,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:43,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:43,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:35:43,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:43,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash -404524899, now seen corresponding path program 1 times [2024-10-11 02:35:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:43,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948469601] [2024-10-11 02:35:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:43,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:35:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:35:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:35:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:35:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:35:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:43,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948469601] [2024-10-11 02:35:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948469601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:43,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:43,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901060353] [2024-10-11 02:35:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:43,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:43,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:43,973 INFO L87 Difference]: Start difference. First operand 538 states and 902 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:48,737 INFO L93 Difference]: Finished difference Result 1313 states and 2234 transitions. [2024-10-11 02:35:48,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:48,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2024-10-11 02:35:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:48,746 INFO L225 Difference]: With dead ends: 1313 [2024-10-11 02:35:48,746 INFO L226 Difference]: Without dead ends: 787 [2024-10-11 02:35:48,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:48,753 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 948 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:48,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 1729 Invalid, 3219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 02:35:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-11 02:35:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 538. [2024-10-11 02:35:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.7088305489260143) internal successors, (716), 438 states have internal predecessors, (716), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 02:35:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 901 transitions. [2024-10-11 02:35:48,885 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 901 transitions. Word has length 84 [2024-10-11 02:35:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:48,885 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 901 transitions. [2024-10-11 02:35:48,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 901 transitions. [2024-10-11 02:35:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 02:35:48,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:48,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:48,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:35:48,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:48,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1415988158, now seen corresponding path program 1 times [2024-10-11 02:35:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:48,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91535369] [2024-10-11 02:35:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:35:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:35:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:35:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:35:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:35:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:49,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:49,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91535369] [2024-10-11 02:35:49,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91535369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:49,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:49,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 02:35:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698728666] [2024-10-11 02:35:49,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:49,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 02:35:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:49,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 02:35:49,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:35:49,742 INFO L87 Difference]: Start difference. First operand 538 states and 901 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:57,640 INFO L93 Difference]: Finished difference Result 1292 states and 2195 transitions. [2024-10-11 02:35:57,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 02:35:57,644 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2024-10-11 02:35:57,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:57,649 INFO L225 Difference]: With dead ends: 1292 [2024-10-11 02:35:57,649 INFO L226 Difference]: Without dead ends: 806 [2024-10-11 02:35:57,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-10-11 02:35:57,653 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1919 mSDsluCounter, 3750 mSDsCounter, 0 mSdLazyCounter, 7600 mSolverCounterSat, 529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 4196 SdHoareTripleChecker+Invalid, 8129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 529 IncrementalHoareTripleChecker+Valid, 7600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:57,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 4196 Invalid, 8129 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [529 Valid, 7600 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-11 02:35:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-11 02:35:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 545. [2024-10-11 02:35:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 424 states have (on average 1.6886792452830188) internal successors, (716), 443 states have internal predecessors, (716), 95 states have call successors, (95), 24 states have call predecessors, (95), 25 states have return successors, (95), 90 states have call predecessors, (95), 90 states have call successors, (95) [2024-10-11 02:35:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 906 transitions. [2024-10-11 02:35:57,775 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 906 transitions. Word has length 85 [2024-10-11 02:35:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:57,776 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 906 transitions. [2024-10-11 02:35:57,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:35:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 906 transitions. [2024-10-11 02:35:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 02:35:57,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:57,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:57,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:35:57,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:57,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash 813642905, now seen corresponding path program 1 times [2024-10-11 02:35:57,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:57,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239196897] [2024-10-11 02:35:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:57,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:35:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:35:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:35:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:35:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:35:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239196897] [2024-10-11 02:35:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239196897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:58,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:58,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:35:58,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156166896] [2024-10-11 02:35:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:58,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:35:58,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:58,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:35:58,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:35:58,493 INFO L87 Difference]: Start difference. First operand 545 states and 906 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:36:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:06,267 INFO L93 Difference]: Finished difference Result 1306 states and 2210 transitions. [2024-10-11 02:36:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:36:06,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2024-10-11 02:36:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:06,271 INFO L225 Difference]: With dead ends: 1306 [2024-10-11 02:36:06,275 INFO L226 Difference]: Without dead ends: 813 [2024-10-11 02:36:06,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:36:06,281 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 1466 mSDsluCounter, 3401 mSDsCounter, 0 mSdLazyCounter, 6837 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 3852 SdHoareTripleChecker+Invalid, 7202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 6837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:06,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 3852 Invalid, 7202 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [365 Valid, 6837 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-11 02:36:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-10-11 02:36:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 546. [2024-10-11 02:36:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 425 states have (on average 1.6752941176470588) internal successors, (712), 443 states have internal predecessors, (712), 95 states have call successors, (95), 24 states have call predecessors, (95), 25 states have return successors, (95), 91 states have call predecessors, (95), 90 states have call successors, (95) [2024-10-11 02:36:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 902 transitions. [2024-10-11 02:36:06,408 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 902 transitions. Word has length 87 [2024-10-11 02:36:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:06,408 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 902 transitions. [2024-10-11 02:36:06,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:36:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 902 transitions. [2024-10-11 02:36:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 02:36:06,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:06,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:06,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:36:06,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:06,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash -477794145, now seen corresponding path program 1 times [2024-10-11 02:36:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:06,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945305562] [2024-10-11 02:36:06,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:06,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:36:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:07,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:07,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:36:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:36:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:07,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:36:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:07,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:36:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:07,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:07,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945305562] [2024-10-11 02:36:07,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945305562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:07,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:07,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195837453] [2024-10-11 02:36:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:07,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:07,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:07,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:07,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:07,153 INFO L87 Difference]: Start difference. First operand 546 states and 902 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:36:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:12,379 INFO L93 Difference]: Finished difference Result 1311 states and 2219 transitions. [2024-10-11 02:36:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:36:12,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2024-10-11 02:36:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:12,384 INFO L225 Difference]: With dead ends: 1311 [2024-10-11 02:36:12,384 INFO L226 Difference]: Without dead ends: 817 [2024-10-11 02:36:12,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:36:12,386 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 1018 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 4529 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 4529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:12,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 2616 Invalid, 4747 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [218 Valid, 4529 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 02:36:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-10-11 02:36:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 549. [2024-10-11 02:36:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 428 states have (on average 1.661214953271028) internal successors, (711), 446 states have internal predecessors, (711), 95 states have call successors, (95), 24 states have call predecessors, (95), 25 states have return successors, (95), 91 states have call predecessors, (95), 90 states have call successors, (95) [2024-10-11 02:36:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 901 transitions. [2024-10-11 02:36:12,469 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 901 transitions. Word has length 88 [2024-10-11 02:36:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:12,469 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 901 transitions. [2024-10-11 02:36:12,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:36:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 901 transitions. [2024-10-11 02:36:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:36:12,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:12,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:12,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:36:12,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:12,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash 412342826, now seen corresponding path program 1 times [2024-10-11 02:36:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:12,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632679096] [2024-10-11 02:36:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:12,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:36:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:36:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:13,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:36:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:13,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:36:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:13,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:13,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632679096] [2024-10-11 02:36:13,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632679096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:13,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:13,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:36:13,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615153755] [2024-10-11 02:36:13,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:13,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:36:13,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:13,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:36:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:36:13,028 INFO L87 Difference]: Start difference. First operand 549 states and 901 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:36:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:27,007 INFO L93 Difference]: Finished difference Result 2520 states and 4448 transitions. [2024-10-11 02:36:27,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 02:36:27,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2024-10-11 02:36:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:27,024 INFO L225 Difference]: With dead ends: 2520 [2024-10-11 02:36:27,025 INFO L226 Difference]: Without dead ends: 2023 [2024-10-11 02:36:27,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:36:27,031 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 5210 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 5915 mSolverCounterSat, 1711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5297 SdHoareTripleChecker+Valid, 3678 SdHoareTripleChecker+Invalid, 7626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1711 IncrementalHoareTripleChecker+Valid, 5915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:27,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5297 Valid, 3678 Invalid, 7626 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1711 Valid, 5915 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-10-11 02:36:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2024-10-11 02:36:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1466. [2024-10-11 02:36:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1130 states have (on average 1.6371681415929205) internal successors, (1850), 1174 states have internal predecessors, (1850), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 262 states have call predecessors, (325), 259 states have call successors, (325) [2024-10-11 02:36:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2439 transitions. [2024-10-11 02:36:27,519 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2439 transitions. Word has length 92 [2024-10-11 02:36:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:27,523 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 2439 transitions. [2024-10-11 02:36:27,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:36:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2439 transitions. [2024-10-11 02:36:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:36:27,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:27,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:27,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:36:27,526 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:27,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:27,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2086786657, now seen corresponding path program 1 times [2024-10-11 02:36:27,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:27,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681976438] [2024-10-11 02:36:27,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:27,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:27,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:27,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:28,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:36:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:28,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:36:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:28,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:36:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:36:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681976438] [2024-10-11 02:36:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681976438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:28,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:28,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:36:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396376552] [2024-10-11 02:36:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:36:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:36:28,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:28,675 INFO L87 Difference]: Start difference. First operand 1466 states and 2439 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:36:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:34,753 INFO L93 Difference]: Finished difference Result 3397 states and 5803 transitions. [2024-10-11 02:36:34,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 02:36:34,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-11 02:36:34,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:34,770 INFO L225 Difference]: With dead ends: 3397 [2024-10-11 02:36:34,770 INFO L226 Difference]: Without dead ends: 1989 [2024-10-11 02:36:34,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:36:34,777 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 980 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 5144 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 5353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 5144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:34,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 2993 Invalid, 5353 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [209 Valid, 5144 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:36:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2024-10-11 02:36:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1477. [2024-10-11 02:36:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1141 states have (on average 1.63102541630149) internal successors, (1861), 1185 states have internal predecessors, (1861), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 262 states have call predecessors, (325), 259 states have call successors, (325) [2024-10-11 02:36:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2450 transitions. [2024-10-11 02:36:35,123 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2450 transitions. Word has length 93 [2024-10-11 02:36:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:35,123 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 2450 transitions. [2024-10-11 02:36:35,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:36:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2450 transitions. [2024-10-11 02:36:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:36:35,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:35,127 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:35,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:36:35,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:35,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1027910619, now seen corresponding path program 1 times [2024-10-11 02:36:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:35,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046349845] [2024-10-11 02:36:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:36:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:36:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:36:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:36:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:36:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:36:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,728 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:36:35,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046349845] [2024-10-11 02:36:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046349845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:35,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:35,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:36:35,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989340785] [2024-10-11 02:36:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:35,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:36:35,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:35,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:36:35,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:35,730 INFO L87 Difference]: Start difference. First operand 1477 states and 2450 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:36:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:40,135 INFO L93 Difference]: Finished difference Result 3424 states and 5815 transitions. [2024-10-11 02:36:40,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:36:40,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-10-11 02:36:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:40,153 INFO L225 Difference]: With dead ends: 3424 [2024-10-11 02:36:40,153 INFO L226 Difference]: Without dead ends: 1999 [2024-10-11 02:36:40,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:36:40,160 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 1894 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:40,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 1599 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:36:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-10-11 02:36:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1477. [2024-10-11 02:36:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1141 states have (on average 1.626643295354952) internal successors, (1856), 1185 states have internal predecessors, (1856), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 262 states have call predecessors, (325), 259 states have call successors, (325) [2024-10-11 02:36:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2445 transitions. [2024-10-11 02:36:40,626 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2445 transitions. Word has length 96 [2024-10-11 02:36:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:40,628 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 2445 transitions. [2024-10-11 02:36:40,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:36:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2445 transitions. [2024-10-11 02:36:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:36:40,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:40,630 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:40,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:36:40,630 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:40,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash 12009352, now seen corresponding path program 1 times [2024-10-11 02:36:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54065354] [2024-10-11 02:36:40,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:40,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:41,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:36:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:41,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:36:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:41,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:36:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:41,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:36:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:41,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:36:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:36:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:41,221 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:36:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54065354] [2024-10-11 02:36:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54065354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:41,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:41,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:36:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119927930] [2024-10-11 02:36:41,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:41,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:36:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:41,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:36:41,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:41,223 INFO L87 Difference]: Start difference. First operand 1477 states and 2445 transitions. Second operand has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)