./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_spec9_product29.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 bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:39:27,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:39:27,130 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:39:27,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:39:27,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:39:27,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:39:27,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:39:27,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:39:27,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:39:27,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:39:27,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:39:27,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:39:27,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:39:27,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:39:27,167 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:39:27,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:39:27,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:39:27,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:39:27,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:39:27,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:39:27,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:39:27,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:39:27,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:39:27,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:39:27,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:39:27,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:39:27,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:39:27,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:39:27,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:39:27,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:39:27,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:39:27,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:39:27,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:39:27,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:39:27,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:39:27,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:39:27,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:39:27,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:39:27,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:39:27,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:39:27,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:39:27,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:39:27,173 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 -> bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 [2024-10-11 02:39:27,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:39:27,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:39:27,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:39:27,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:39:27,394 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:39:27,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2024-10-11 02:39:28,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:39:28,815 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:39:28,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2024-10-11 02:39:28,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/474a17953/6b946841dcc2437385a2402374e61b6d/FLAGacdb7b8f0 [2024-10-11 02:39:29,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/474a17953/6b946841dcc2437385a2402374e61b6d [2024-10-11 02:39:29,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:39:29,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:39:29,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:39:29,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:39:29,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:39:29,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f19930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29, skipping insertion in model container [2024-10-11 02:39:29,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:39:29,320 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c[1700,1713] [2024-10-11 02:39:29,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:39:29,528 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:39:29,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-10-11 02:39:29,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [62] [2024-10-11 02:39:29,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [71] [2024-10-11 02:39:29,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [235] [2024-10-11 02:39:29,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [903] [2024-10-11 02:39:29,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1263] [2024-10-11 02:39:29,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1355] [2024-10-11 02:39:29,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1390] [2024-10-11 02:39:29,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1756] [2024-10-11 02:39:29,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3289] [2024-10-11 02:39:29,542 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c[1700,1713] [2024-10-11 02:39:29,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:39:29,644 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:39:29,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29 WrapperNode [2024-10-11 02:39:29,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:39:29,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:39:29,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:39:29,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:39:29,650 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:39:29" (1/1) ... [2024-10-11 02:39:29,672 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:39:29" (1/1) ... [2024-10-11 02:39:29,706 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 863 [2024-10-11 02:39:29,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:39:29,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:39:29,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:39:29,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:39:29,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,750 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:39:29,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:39:29,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:39:29,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:39:29,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:39:29,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (1/1) ... [2024-10-11 02:39:29,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:39:29,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:39:29,831 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:39:29,834 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:39:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:39:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:39:29,871 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:39:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:39:29,871 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:39:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:39:29,871 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:39:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:39:29,871 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:39:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:39:29,871 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:39:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-11 02:39:29,872 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-11 02:39:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:39:29,872 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:39:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:39:29,872 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:39:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:39:29,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:39:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:39:29,872 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:39:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:39:29,872 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:39:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:39:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:39:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:39:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:39:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:39:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:39:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:39:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:39:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:39:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:39:29,874 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:39:29,874 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-10-11 02:39:29,874 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:39:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:39:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:39:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:39:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:39:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:39:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:39:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:39:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:39:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:39:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:39:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:39:30,064 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:39:30,065 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:39:30,909 INFO L? ?]: Removed 454 outVars from TransFormulas that were not future-live. [2024-10-11 02:39:30,909 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:39:30,974 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:39:30,977 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:39:30,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:30 BoogieIcfgContainer [2024-10-11 02:39:30,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:39:30,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:39:30,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:39:30,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:39:30,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:39:29" (1/3) ... [2024-10-11 02:39:30,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22dc43ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:30, skipping insertion in model container [2024-10-11 02:39:30,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:29" (2/3) ... [2024-10-11 02:39:30,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22dc43ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:30, skipping insertion in model container [2024-10-11 02:39:30,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:30" (3/3) ... [2024-10-11 02:39:30,984 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2024-10-11 02:39:30,996 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:39:30,996 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:39:31,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:39:31,065 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;@d5b3e69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:39:31,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:39:31,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 542 states, 424 states have (on average 1.7334905660377358) internal successors, (735), 445 states have internal predecessors, (735), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:39:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 02:39:31,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:31,104 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:39:31,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:31,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash -853912051, now seen corresponding path program 1 times [2024-10-11 02:39:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020957130] [2024-10-11 02:39:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:31,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:32,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:39:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:32,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:32,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:39:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:32,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:39:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:32,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:32,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:39:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:32,204 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:39:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:32,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020957130] [2024-10-11 02:39:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020957130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:32,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:39:32,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388007630] [2024-10-11 02:39:32,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:32,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:39:32,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:32,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:39:32,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:39:32,233 INFO L87 Difference]: Start difference. First operand has 542 states, 424 states have (on average 1.7334905660377358) internal successors, (735), 445 states have internal predecessors, (735), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:39:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:36,353 INFO L93 Difference]: Finished difference Result 1298 states and 2234 transitions. [2024-10-11 02:39:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:39:36,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 81 [2024-10-11 02:39:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:36,374 INFO L225 Difference]: With dead ends: 1298 [2024-10-11 02:39:36,374 INFO L226 Difference]: Without dead ends: 765 [2024-10-11 02:39:36,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:36,387 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 1865 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 2806 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 3282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 2806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:36,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 1467 Invalid, 3282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 2806 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:39:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-11 02:39:36,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-11 02:39:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 422 states have (on average 1.7227488151658767) internal successors, (727), 441 states have internal predecessors, (727), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-11 02:39:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 906 transitions. [2024-10-11 02:39:36,556 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 906 transitions. Word has length 81 [2024-10-11 02:39:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:36,557 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 906 transitions. [2024-10-11 02:39:36,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:39:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 906 transitions. [2024-10-11 02:39:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 02:39:36,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:36,561 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:39:36,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:39:36,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:36,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:36,562 INFO L85 PathProgramCache]: Analyzing trace with hash -609393153, now seen corresponding path program 1 times [2024-10-11 02:39:36,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:36,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337497429] [2024-10-11 02:39:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:36,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:36,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:39:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:39:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:39:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:39:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:39:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,135 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:39:37,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:37,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337497429] [2024-10-11 02:39:37,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337497429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:37,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:37,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:39:37,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7973222] [2024-10-11 02:39:37,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:37,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:39:37,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:37,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:39:37,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:39:37,138 INFO L87 Difference]: Start difference. First operand 538 states and 906 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:39:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:40,940 INFO L93 Difference]: Finished difference Result 1291 states and 2203 transitions. [2024-10-11 02:39:40,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:39:40,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 83 [2024-10-11 02:39:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:40,946 INFO L225 Difference]: With dead ends: 1291 [2024-10-11 02:39:40,946 INFO L226 Difference]: Without dead ends: 765 [2024-10-11 02:39:40,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:40,948 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 1403 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:40,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1508 Invalid, 3303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:39:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-11 02:39:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-11 02:39:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 422 states have (on average 1.7203791469194314) internal successors, (726), 441 states have internal predecessors, (726), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-11 02:39:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 905 transitions. [2024-10-11 02:39:41,057 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 905 transitions. Word has length 83 [2024-10-11 02:39:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:41,057 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 905 transitions. [2024-10-11 02:39:41,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:39:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 905 transitions. [2024-10-11 02:39:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 02:39:41,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:41,062 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:39:41,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:39:41,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:41,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1835312252, now seen corresponding path program 1 times [2024-10-11 02:39:41,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:41,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176777576] [2024-10-11 02:39:41,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:41,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:39:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:39:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:39:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:39:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:41,558 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:39:41,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:41,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176777576] [2024-10-11 02:39:41,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176777576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:41,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:41,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:39:41,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333762218] [2024-10-11 02:39:41,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:41,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:39:41,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:41,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:39:41,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:39:41,561 INFO L87 Difference]: Start difference. First operand 538 states and 905 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:39:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:44,797 INFO L93 Difference]: Finished difference Result 1291 states and 2202 transitions. [2024-10-11 02:39:44,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:39:44,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2024-10-11 02:39:44,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:44,803 INFO L225 Difference]: With dead ends: 1291 [2024-10-11 02:39:44,803 INFO L226 Difference]: Without dead ends: 765 [2024-10-11 02:39:44,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:44,818 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 1865 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2787 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 2787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:44,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 1443 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 2787 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 02:39:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-11 02:39:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-11 02:39:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 422 states have (on average 1.7180094786729858) internal successors, (725), 441 states have internal predecessors, (725), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-11 02:39:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 904 transitions. [2024-10-11 02:39:44,895 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 904 transitions. Word has length 84 [2024-10-11 02:39:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:44,896 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 904 transitions. [2024-10-11 02:39:44,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:39:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 904 transitions. [2024-10-11 02:39:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 02:39:44,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:44,898 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:39:44,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:39:44,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:44,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:44,899 INFO L85 PathProgramCache]: Analyzing trace with hash 452061979, now seen corresponding path program 1 times [2024-10-11 02:39:44,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:44,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999911111] [2024-10-11 02:39:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:39:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:39:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:39:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:39:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:39:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:45,363 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:39:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999911111] [2024-10-11 02:39:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999911111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:39:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163126650] [2024-10-11 02:39:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:45,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:39:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:39:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:39:45,365 INFO L87 Difference]: Start difference. First operand 538 states and 904 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:39:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:48,682 INFO L93 Difference]: Finished difference Result 1291 states and 2201 transitions. [2024-10-11 02:39:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:39:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 85 [2024-10-11 02:39:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:48,687 INFO L225 Difference]: With dead ends: 1291 [2024-10-11 02:39:48,687 INFO L226 Difference]: Without dead ends: 765 [2024-10-11 02:39:48,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:48,690 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 1410 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 2832 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 2832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:48,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1485 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 2832 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 02:39:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-11 02:39:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 538. [2024-10-11 02:39:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 422 states have (on average 1.7156398104265402) internal successors, (724), 441 states have internal predecessors, (724), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-11 02:39:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 903 transitions. [2024-10-11 02:39:48,783 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 903 transitions. Word has length 85 [2024-10-11 02:39:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:48,783 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 903 transitions. [2024-10-11 02:39:48,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:39:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 903 transitions. [2024-10-11 02:39:48,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 02:39:48,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:48,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:48,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:39:48,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:48,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash 661269976, now seen corresponding path program 1 times [2024-10-11 02:39:48,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:48,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134372084] [2024-10-11 02:39:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:48,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:39:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:39:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:39:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:39:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:39:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:39:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,430 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:39:49,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:49,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134372084] [2024-10-11 02:39:49,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134372084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:49,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:49,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 02:39:49,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35953093] [2024-10-11 02:39:49,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:49,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 02:39:49,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:49,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 02:39:49,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:39:49,432 INFO L87 Difference]: Start difference. First operand 538 states and 903 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:39:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:55,248 INFO L93 Difference]: Finished difference Result 1300 states and 2222 transitions. [2024-10-11 02:39:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:39:55,249 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 86 [2024-10-11 02:39:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:55,253 INFO L225 Difference]: With dead ends: 1300 [2024-10-11 02:39:55,253 INFO L226 Difference]: Without dead ends: 774 [2024-10-11 02:39:55,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2024-10-11 02:39:55,256 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 969 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 7882 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 8094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 7882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:55,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 3839 Invalid, 8094 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [212 Valid, 7882 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 02:39:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-10-11 02:39:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 545. [2024-10-11 02:39:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 427 states have (on average 1.7049180327868851) internal successors, (728), 446 states have internal predecessors, (728), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 87 states have call predecessors, (92), 87 states have call successors, (92) [2024-10-11 02:39:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 912 transitions. [2024-10-11 02:39:55,359 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 912 transitions. Word has length 86 [2024-10-11 02:39:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:55,359 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 912 transitions. [2024-10-11 02:39:55,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:39:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 912 transitions. [2024-10-11 02:39:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 02:39:55,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:55,365 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:39:55,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:39:55,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:55,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash -240309307, now seen corresponding path program 1 times [2024-10-11 02:39:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:55,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574656832] [2024-10-11 02:39:55,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:55,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:55,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:55,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:55,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:39:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:55,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:39:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:55,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:39:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:56,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:39:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:56,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:39:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:56,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:39:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:56,016 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:39:56,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:56,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574656832] [2024-10-11 02:39:56,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574656832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:56,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:56,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:39:56,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770802280] [2024-10-11 02:39:56,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:56,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:39:56,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:56,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:39:56,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:39:56,018 INFO L87 Difference]: Start difference. First operand 545 states and 912 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:40:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:01,432 INFO L93 Difference]: Finished difference Result 1284 states and 2181 transitions. [2024-10-11 02:40:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:40:01,432 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 88 [2024-10-11 02:40:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:01,437 INFO L225 Difference]: With dead ends: 1284 [2024-10-11 02:40:01,437 INFO L226 Difference]: Without dead ends: 791 [2024-10-11 02:40:01,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:40:01,440 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1466 mSDsluCounter, 3072 mSDsCounter, 0 mSdLazyCounter, 7076 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 3482 SdHoareTripleChecker+Invalid, 7426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 7076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:01,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 3482 Invalid, 7426 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [350 Valid, 7076 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 02:40:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-10-11 02:40:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 546. [2024-10-11 02:40:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 428 states have (on average 1.691588785046729) internal successors, (724), 446 states have internal predecessors, (724), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 88 states have call predecessors, (92), 87 states have call successors, (92) [2024-10-11 02:40:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 908 transitions. [2024-10-11 02:40:01,536 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 908 transitions. Word has length 88 [2024-10-11 02:40:01,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:01,536 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 908 transitions. [2024-10-11 02:40:01,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:40:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 908 transitions. [2024-10-11 02:40:01,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 02:40:01,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:01,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:01,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:40:01,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:01,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash 748065232, now seen corresponding path program 1 times [2024-10-11 02:40:01,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:01,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076278660] [2024-10-11 02:40:01,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:01,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:40:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:40:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:40:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:40:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:40:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:40:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:02,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:02,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076278660] [2024-10-11 02:40:02,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076278660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:02,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:02,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:40:02,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582625974] [2024-10-11 02:40:02,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:02,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:40:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:40:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:40:02,119 INFO L87 Difference]: Start difference. First operand 546 states and 908 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:40:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:06,319 INFO L93 Difference]: Finished difference Result 1282 states and 2170 transitions. [2024-10-11 02:40:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:40:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-11 02:40:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:06,324 INFO L225 Difference]: With dead ends: 1282 [2024-10-11 02:40:06,324 INFO L226 Difference]: Without dead ends: 788 [2024-10-11 02:40:06,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:40:06,326 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 1470 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 5318 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 5669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 5318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:06,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 2634 Invalid, 5669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 5318 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:40:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-11 02:40:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 549. [2024-10-11 02:40:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 431 states have (on average 1.6751740139211138) internal successors, (722), 449 states have internal predecessors, (722), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 88 states have call predecessors, (92), 87 states have call successors, (92) [2024-10-11 02:40:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 906 transitions. [2024-10-11 02:40:06,403 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 906 transitions. Word has length 89 [2024-10-11 02:40:06,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:06,403 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 906 transitions. [2024-10-11 02:40:06,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:40:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 906 transitions. [2024-10-11 02:40:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:40:06,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:06,405 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:06,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:40:06,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:06,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2134440608, now seen corresponding path program 1 times [2024-10-11 02:40:06,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:06,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032378618] [2024-10-11 02:40:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:06,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:06,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:06,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:06,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:06,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:40:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:07,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:40:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:07,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:40:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:40:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:07,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:07,015 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:40:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032378618] [2024-10-11 02:40:07,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032378618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:07,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:07,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:40:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370561260] [2024-10-11 02:40:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:07,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:40:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:40:07,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:40:07,016 INFO L87 Difference]: Start difference. First operand 549 states and 906 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:40:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:12,413 INFO L93 Difference]: Finished difference Result 1301 states and 2201 transitions. [2024-10-11 02:40:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 02:40:12,413 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 92 [2024-10-11 02:40:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:12,417 INFO L225 Difference]: With dead ends: 1301 [2024-10-11 02:40:12,417 INFO L226 Difference]: Without dead ends: 812 [2024-10-11 02:40:12,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2024-10-11 02:40:12,421 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1039 mSDsluCounter, 3114 mSDsCounter, 0 mSdLazyCounter, 7037 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 7251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 7037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:12,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 3524 Invalid, 7251 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [214 Valid, 7037 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 02:40:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-11 02:40:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 564. [2024-10-11 02:40:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 443 states have (on average 1.670428893905192) internal successors, (740), 463 states have internal predecessors, (740), 93 states have call successors, (93), 24 states have call predecessors, (93), 27 states have return successors, (95), 89 states have call predecessors, (95), 88 states have call successors, (95) [2024-10-11 02:40:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 928 transitions. [2024-10-11 02:40:12,507 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 928 transitions. Word has length 92 [2024-10-11 02:40:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:12,507 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 928 transitions. [2024-10-11 02:40:12,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:40:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 928 transitions. [2024-10-11 02:40:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:40:12,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:12,510 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:12,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:40:12,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:12,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:12,511 INFO L85 PathProgramCache]: Analyzing trace with hash -601725165, now seen corresponding path program 1 times [2024-10-11 02:40:12,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:12,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202473146] [2024-10-11 02:40:12,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:12,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:12,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:12,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:40:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:12,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:12,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:13,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:13,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:40:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:40:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:40:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:40:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:40:13,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202473146] [2024-10-11 02:40:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202473146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:40:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693538690] [2024-10-11 02:40:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:13,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:40:13,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:40:13,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:40:13,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:40:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:13,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:40:13,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:40:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:13,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:40:13,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693538690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:13,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:40:13,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 14 [2024-10-11 02:40:13,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798174888] [2024-10-11 02:40:13,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:13,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:40:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:13,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:40:13,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:40:13,352 INFO L87 Difference]: Start difference. First operand 564 states and 928 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:13,596 INFO L93 Difference]: Finished difference Result 1496 states and 2519 transitions. [2024-10-11 02:40:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:40:13,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-11 02:40:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:13,604 INFO L225 Difference]: With dead ends: 1496 [2024-10-11 02:40:13,604 INFO L226 Difference]: Without dead ends: 1009 [2024-10-11 02:40:13,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:40:13,606 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 823 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:13,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1636 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:40:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-11 02:40:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 994. [2024-10-11 02:40:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 777 states have (on average 1.6537966537966537) internal successors, (1285), 810 states have internal predecessors, (1285), 168 states have call successors, (168), 43 states have call predecessors, (168), 48 states have return successors, (194), 166 states have call predecessors, (194), 163 states have call successors, (194) [2024-10-11 02:40:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1647 transitions. [2024-10-11 02:40:13,756 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1647 transitions. Word has length 95 [2024-10-11 02:40:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:13,756 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1647 transitions. [2024-10-11 02:40:13,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1647 transitions. [2024-10-11 02:40:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:40:13,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:13,759 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:40:13,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 02:40:13,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:40:13,960 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:13,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2055199571, now seen corresponding path program 1 times [2024-10-11 02:40:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083979520] [2024-10-11 02:40:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:40:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:40:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,405 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:40:14,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:14,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083979520] [2024-10-11 02:40:14,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083979520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:14,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:14,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:40:14,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966504627] [2024-10-11 02:40:14,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:14,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:40:14,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:14,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:40:14,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:14,406 INFO L87 Difference]: Start difference. First operand 994 states and 1647 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:17,810 INFO L93 Difference]: Finished difference Result 2332 states and 3954 transitions. [2024-10-11 02:40:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:40:17,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2024-10-11 02:40:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:17,818 INFO L225 Difference]: With dead ends: 2332 [2024-10-11 02:40:17,818 INFO L226 Difference]: Without dead ends: 1394 [2024-10-11 02:40:17,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:40:17,821 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1008 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 2930 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 3139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:17,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1526 Invalid, 3139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2930 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:40:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-10-11 02:40:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1032. [2024-10-11 02:40:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 809 states have (on average 1.6514215080346106) internal successors, (1336), 842 states have internal predecessors, (1336), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-11 02:40:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1709 transitions. [2024-10-11 02:40:17,992 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1709 transitions. Word has length 96 [2024-10-11 02:40:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:17,992 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1709 transitions. [2024-10-11 02:40:17,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1709 transitions. [2024-10-11 02:40:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:40:17,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:17,997 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:17,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:40:17,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:17,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash 395601334, now seen corresponding path program 1 times [2024-10-11 02:40:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:17,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806309749] [2024-10-11 02:40:17,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:40:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:40:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:18,557 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:40:18,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:18,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806309749] [2024-10-11 02:40:18,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806309749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:18,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:18,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:40:18,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069031556] [2024-10-11 02:40:18,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:18,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:40:18,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:18,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:40:18,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:40:18,559 INFO L87 Difference]: Start difference. First operand 1032 states and 1709 transitions. Second operand has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:40:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:22,994 INFO L93 Difference]: Finished difference Result 2350 states and 3979 transitions. [2024-10-11 02:40:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:40:22,995 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2024-10-11 02:40:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:23,002 INFO L225 Difference]: With dead ends: 2350 [2024-10-11 02:40:23,002 INFO L226 Difference]: Without dead ends: 1388 [2024-10-11 02:40:23,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:40:23,023 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1895 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 5053 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1968 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 5549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 5053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:23,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1968 Valid, 2615 Invalid, 5549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 5053 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:40:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-11 02:40:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1032. [2024-10-11 02:40:23,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 809 states have (on average 1.650185414091471) internal successors, (1335), 842 states have internal predecessors, (1335), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-11 02:40:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1708 transitions. [2024-10-11 02:40:23,192 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1708 transitions. Word has length 97 [2024-10-11 02:40:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:23,192 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1708 transitions. [2024-10-11 02:40:23,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:40:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1708 transitions. [2024-10-11 02:40:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:40:23,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:23,194 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:23,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:40:23,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:23,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1024998102, now seen corresponding path program 1 times [2024-10-11 02:40:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:23,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723076226] [2024-10-11 02:40:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:23,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:40:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:40:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:23,695 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:40:23,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:23,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723076226] [2024-10-11 02:40:23,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723076226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:23,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:23,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:40:23,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059318137] [2024-10-11 02:40:23,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:23,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:40:23,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:23,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:40:23,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:23,697 INFO L87 Difference]: Start difference. First operand 1032 states and 1708 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:27,082 INFO L93 Difference]: Finished difference Result 2370 states and 4012 transitions. [2024-10-11 02:40:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:40:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 97 [2024-10-11 02:40:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:27,090 INFO L225 Difference]: With dead ends: 2370 [2024-10-11 02:40:27,090 INFO L226 Difference]: Without dead ends: 1394 [2024-10-11 02:40:27,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:40:27,093 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 1007 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:27,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1543 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:40:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-10-11 02:40:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1032. [2024-10-11 02:40:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 809 states have (on average 1.6440049443757725) internal successors, (1330), 842 states have internal predecessors, (1330), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-11 02:40:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1703 transitions. [2024-10-11 02:40:27,289 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1703 transitions. Word has length 97 [2024-10-11 02:40:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:27,289 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1703 transitions. [2024-10-11 02:40:27,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1703 transitions. [2024-10-11 02:40:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:40:27,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:27,292 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:27,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:40:27,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:27,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash 52320778, now seen corresponding path program 1 times [2024-10-11 02:40:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:27,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159817788] [2024-10-11 02:40:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:40:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:40:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:27,677 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:40:27,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:27,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159817788] [2024-10-11 02:40:27,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159817788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:27,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:27,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:40:27,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421571896] [2024-10-11 02:40:27,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:27,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:40:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:27,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:40:27,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:27,679 INFO L87 Difference]: Start difference. First operand 1032 states and 1703 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:30,922 INFO L93 Difference]: Finished difference Result 2354 states and 3978 transitions. [2024-10-11 02:40:30,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:40:30,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-11 02:40:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:30,928 INFO L225 Difference]: With dead ends: 2354 [2024-10-11 02:40:30,928 INFO L226 Difference]: Without dead ends: 1390 [2024-10-11 02:40:30,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:40:30,931 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1893 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 3118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:30,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1965 Valid, 1435 Invalid, 3118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:40:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-10-11 02:40:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1035. [2024-10-11 02:40:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 812 states have (on average 1.6403940886699508) internal successors, (1332), 845 states have internal predecessors, (1332), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-11 02:40:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1705 transitions. [2024-10-11 02:40:31,107 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1705 transitions. Word has length 98 [2024-10-11 02:40:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:31,107 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1705 transitions. [2024-10-11 02:40:31,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1705 transitions. [2024-10-11 02:40:31,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:40:31,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:31,110 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:31,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:40:31,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:31,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:31,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1024013144, now seen corresponding path program 1 times [2024-10-11 02:40:31,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:31,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951326498] [2024-10-11 02:40:31,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:40:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:40:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:31,484 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:40:31,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:31,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951326498] [2024-10-11 02:40:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951326498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:31,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:31,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:40:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055313336] [2024-10-11 02:40:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:31,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:40:31,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:31,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:40:31,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:31,486 INFO L87 Difference]: Start difference. First operand 1035 states and 1705 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:34,466 INFO L93 Difference]: Finished difference Result 2379 states and 4012 transitions. [2024-10-11 02:40:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:40:34,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-11 02:40:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:34,473 INFO L225 Difference]: With dead ends: 2379 [2024-10-11 02:40:34,473 INFO L226 Difference]: Without dead ends: 1400 [2024-10-11 02:40:34,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:40:34,476 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1920 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:34,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 1435 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:40:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-10-11 02:40:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1035. [2024-10-11 02:40:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 812 states have (on average 1.6342364532019704) internal successors, (1327), 845 states have internal predecessors, (1327), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-11 02:40:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1700 transitions. [2024-10-11 02:40:34,672 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1700 transitions. Word has length 98 [2024-10-11 02:40:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:34,673 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1700 transitions. [2024-10-11 02:40:34,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1700 transitions. [2024-10-11 02:40:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:40:34,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:34,675 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:34,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:40:34,675 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:34,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:34,675 INFO L85 PathProgramCache]: Analyzing trace with hash 218615249, now seen corresponding path program 1 times [2024-10-11 02:40:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:34,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183709151] [2024-10-11 02:40:34,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:34,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:34,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:34,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:40:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:40:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,114 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:40:35,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:35,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183709151] [2024-10-11 02:40:35,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183709151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:35,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:35,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:40:35,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925494523] [2024-10-11 02:40:35,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:35,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:40:35,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:35,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:40:35,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:35,115 INFO L87 Difference]: Start difference. First operand 1035 states and 1700 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:38,299 INFO L93 Difference]: Finished difference Result 2362 states and 3979 transitions. [2024-10-11 02:40:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:40:38,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-11 02:40:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:38,306 INFO L225 Difference]: With dead ends: 2362 [2024-10-11 02:40:38,306 INFO L226 Difference]: Without dead ends: 1398 [2024-10-11 02:40:38,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:40:38,309 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 1883 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:38,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 1441 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:40:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-11 02:40:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1039. [2024-10-11 02:40:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 816 states have (on average 1.6299019607843137) internal successors, (1330), 849 states have internal predecessors, (1330), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-10-11 02:40:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1703 transitions. [2024-10-11 02:40:38,494 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1703 transitions. Word has length 99 [2024-10-11 02:40:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:38,494 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1703 transitions. [2024-10-11 02:40:38,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1703 transitions. [2024-10-11 02:40:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:40:38,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:38,495 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:38,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:40:38,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:38,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1130256369, now seen corresponding path program 1 times [2024-10-11 02:40:38,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:38,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077354115] [2024-10-11 02:40:38,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:38,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:40:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:40:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,880 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:40:38,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:38,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077354115] [2024-10-11 02:40:38,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077354115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:38,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:38,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:40:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824878782] [2024-10-11 02:40:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:38,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:40:38,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:40:38,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:38,882 INFO L87 Difference]: Start difference. First operand 1039 states and 1703 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:42,305 INFO L93 Difference]: Finished difference Result 2417 states and 4042 transitions. [2024-10-11 02:40:42,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:40:42,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-11 02:40:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:42,311 INFO L225 Difference]: With dead ends: 2417 [2024-10-11 02:40:42,311 INFO L226 Difference]: Without dead ends: 1372 [2024-10-11 02:40:42,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:40:42,314 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 923 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 3076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:42,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1548 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2878 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 02:40:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-10-11 02:40:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1021. [2024-10-11 02:40:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 801 states have (on average 1.634207240948814) internal successors, (1309), 832 states have internal predecessors, (1309), 171 states have call successors, (171), 43 states have call predecessors, (171), 48 states have return successors, (198), 169 states have call predecessors, (198), 166 states have call successors, (198) [2024-10-11 02:40:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1678 transitions. [2024-10-11 02:40:42,496 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1678 transitions. Word has length 99 [2024-10-11 02:40:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:42,496 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1678 transitions. [2024-10-11 02:40:42,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:40:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1678 transitions. [2024-10-11 02:40:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 02:40:42,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:42,501 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:42,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:40:42,501 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:42,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash -998133627, now seen corresponding path program 1 times [2024-10-11 02:40:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:42,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737059485] [2024-10-11 02:40:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:42,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:40:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:40:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,924 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:40:42,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:42,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737059485] [2024-10-11 02:40:42,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737059485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:42,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:42,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:40:42,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284747463] [2024-10-11 02:40:42,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:42,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:40:42,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:42,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:40:42,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:40:42,925 INFO L87 Difference]: Start difference. First operand 1021 states and 1678 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:40:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:47,398 INFO L93 Difference]: Finished difference Result 2344 states and 3947 transitions. [2024-10-11 02:40:47,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:40:47,399 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2024-10-11 02:40:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:47,406 INFO L225 Difference]: With dead ends: 2344 [2024-10-11 02:40:47,406 INFO L226 Difference]: Without dead ends: 1382 [2024-10-11 02:40:47,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:40:47,409 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 947 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 5134 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 5336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 5134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:47,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 2733 Invalid, 5336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 5134 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 02:40:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-10-11 02:40:47,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1026. [2024-10-11 02:40:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 806 states have (on average 1.630272952853598) internal successors, (1314), 837 states have internal predecessors, (1314), 171 states have call successors, (171), 43 states have call predecessors, (171), 48 states have return successors, (198), 169 states have call predecessors, (198), 166 states have call successors, (198) [2024-10-11 02:40:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1683 transitions. [2024-10-11 02:40:47,614 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1683 transitions. Word has length 100 [2024-10-11 02:40:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:47,614 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1683 transitions. [2024-10-11 02:40:47,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:40:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1683 transitions. [2024-10-11 02:40:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:40:47,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:47,616 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:47,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:40:47,616 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:47,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1711990236, now seen corresponding path program 1 times [2024-10-11 02:40:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:47,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689522206] [2024-10-11 02:40:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:47,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:47,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:47,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:47,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:47,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:40:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:48,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:40:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:48,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:40:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:48,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:48,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:48,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:48,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:40:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:48,118 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:40:48,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:48,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689522206] [2024-10-11 02:40:48,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689522206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:48,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:48,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:40:48,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63340798] [2024-10-11 02:40:48,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:48,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:40:48,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:48,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:40:48,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:40:48,119 INFO L87 Difference]: Start difference. First operand 1026 states and 1683 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12)