./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67b10dcf95f436cfd8f02a55d7d1d272656f1382a4eb6ab4ad3bba992e95e024 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:18:31,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:18:32,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:18:32,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:18:32,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:18:32,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:18:32,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:18:32,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:18:32,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:18:32,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:18:32,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:18:32,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:18:32,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:18:32,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:18:32,090 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:18:32,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:18:32,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:18:32,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:18:32,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:18:32,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:18:32,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:18:32,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:18:32,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:18:32,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:18:32,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:18:32,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:18:32,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:18:32,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:18:32,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:18:32,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:18:32,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:18:32,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:18:32,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:18:32,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:18:32,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:18:32,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:18:32,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:18:32,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:18:32,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:18:32,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:18:32,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:18:32,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:18:32,100 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67b10dcf95f436cfd8f02a55d7d1d272656f1382a4eb6ab4ad3bba992e95e024 [2024-10-12 19:18:32,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:18:32,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:18:32,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:18:32,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:18:32,399 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:18:32,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c [2024-10-12 19:18:33,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:18:34,226 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:18:34,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c [2024-10-12 19:18:34,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb038e6e/ab9e922b46134b24b6b0b2649d2ed2b3/FLAGa9ef3c834 [2024-10-12 19:18:34,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb038e6e/ab9e922b46134b24b6b0b2649d2ed2b3 [2024-10-12 19:18:34,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:18:34,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:18:34,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:18:34,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:18:34,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:18:34,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:18:34" (1/1) ... [2024-10-12 19:18:34,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225ff183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:34, skipping insertion in model container [2024-10-12 19:18:34,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:18:34" (1/1) ... [2024-10-12 19:18:34,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:18:34,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c[21710,21723] [2024-10-12 19:18:34,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:18:34,898 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:18:34,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2024-10-12 19:18:34,916 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [147] [2024-10-12 19:18:34,916 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [165] [2024-10-12 19:18:34,916 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [832] [2024-10-12 19:18:34,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [952] [2024-10-12 19:18:34,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [961] [2024-10-12 19:18:34,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2404] [2024-10-12 19:18:34,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2442] [2024-10-12 19:18:34,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2790] [2024-10-12 19:18:34,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2976] [2024-10-12 19:18:34,960 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c[21710,21723] [2024-10-12 19:18:35,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:18:35,098 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:18:35,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35 WrapperNode [2024-10-12 19:18:35,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:18:35,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:18:35,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:18:35,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:18:35,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,175 INFO L138 Inliner]: procedures = 87, calls = 336, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 807 [2024-10-12 19:18:35,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:18:35,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:18:35,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:18:35,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:18:35,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,233 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-12 19:18:35,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:18:35,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:18:35,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:18:35,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:18:35,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (1/1) ... [2024-10-12 19:18:35,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:18:35,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:18:35,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:18:35,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:18:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:18:35,384 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-12 19:18:35,384 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-12 19:18:35,384 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:18:35,384 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:18:35,384 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:18:35,384 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:18:35,385 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-12 19:18:35,385 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-12 19:18:35,386 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:18:35,386 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:18:35,386 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:18:35,386 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:18:35,386 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:18:35,387 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:18:35,387 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:18:35,388 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:18:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:18:35,388 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:18:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:18:35,388 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:18:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:18:35,388 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:18:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-12 19:18:35,388 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-12 19:18:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:18:35,388 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:18:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-12 19:18:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-12 19:18:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:18:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:18:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:18:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:18:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:18:35,392 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:18:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:18:35,392 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:18:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:18:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:18:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:18:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:18:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:18:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:18:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:18:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:18:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:18:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:18:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-12 19:18:35,394 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-12 19:18:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:18:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:18:35,395 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:18:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:18:35,395 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:18:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:18:35,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:18:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:18:35,396 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:18:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:18:35,646 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:18:35,648 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:18:36,702 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2024-10-12 19:18:36,702 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:18:36,771 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:18:36,772 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:18:36,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:18:36 BoogieIcfgContainer [2024-10-12 19:18:36,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:18:36,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:18:36,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:18:36,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:18:36,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:18:34" (1/3) ... [2024-10-12 19:18:36,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdba5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:18:36, skipping insertion in model container [2024-10-12 19:18:36,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:35" (2/3) ... [2024-10-12 19:18:36,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdba5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:18:36, skipping insertion in model container [2024-10-12 19:18:36,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:18:36" (3/3) ... [2024-10-12 19:18:36,781 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product09.cil.c [2024-10-12 19:18:36,797 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:18:36,797 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:18:36,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:18:36,891 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;@dd117bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:18:36,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:18:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 536 states, 413 states have (on average 1.7263922518159807) internal successors, (713), 431 states have internal predecessors, (713), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-12 19:18:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 19:18:36,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:36,926 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] [2024-10-12 19:18:36,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:36,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1944334352, now seen corresponding path program 1 times [2024-10-12 19:18:36,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:36,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273012298] [2024-10-12 19:18:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:18:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:18:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:18:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:18:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:18:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:18:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:18:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:18:38,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273012298] [2024-10-12 19:18:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273012298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:38,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:38,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:18:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687234973] [2024-10-12 19:18:38,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:38,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:18:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:38,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:18:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:18:38,472 INFO L87 Difference]: Start difference. First operand has 536 states, 413 states have (on average 1.7263922518159807) internal successors, (713), 431 states have internal predecessors, (713), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:18:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:46,304 INFO L93 Difference]: Finished difference Result 1415 states and 2503 transitions. [2024-10-12 19:18:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:18:46,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 75 [2024-10-12 19:18:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:46,338 INFO L225 Difference]: With dead ends: 1415 [2024-10-12 19:18:46,339 INFO L226 Difference]: Without dead ends: 876 [2024-10-12 19:18:46,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:18:46,357 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 1658 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 5402 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 5836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:46,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 2835 Invalid, 5836 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [434 Valid, 5402 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-12 19:18:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-12 19:18:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 542. [2024-10-12 19:18:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 419 states have (on average 1.7112171837708832) internal successors, (717), 437 states have internal predecessors, (717), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (98), 94 states have call predecessors, (98), 96 states have call successors, (98) [2024-10-12 19:18:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 914 transitions. [2024-10-12 19:18:46,644 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 914 transitions. Word has length 75 [2024-10-12 19:18:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:46,645 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 914 transitions. [2024-10-12 19:18:46,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:18:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 914 transitions. [2024-10-12 19:18:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 19:18:46,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:46,655 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] [2024-10-12 19:18:46,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:18:46,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:46,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1775703688, now seen corresponding path program 1 times [2024-10-12 19:18:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:46,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403384601] [2024-10-12 19:18:46,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:46,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:18:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:18:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:18:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:18:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:18:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:18:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:18:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:18:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:47,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403384601] [2024-10-12 19:18:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403384601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:47,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:47,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:18:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945775985] [2024-10-12 19:18:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:47,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:18:47,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:47,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:18:47,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:47,378 INFO L87 Difference]: Start difference. First operand 542 states and 914 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:18:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:52,675 INFO L93 Difference]: Finished difference Result 1404 states and 2446 transitions. [2024-10-12 19:18:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:18:52,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76 [2024-10-12 19:18:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:52,683 INFO L225 Difference]: With dead ends: 1404 [2024-10-12 19:18:52,683 INFO L226 Difference]: Without dead ends: 872 [2024-10-12 19:18:52,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:18:52,688 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1059 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 3034 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 3034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:52,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 1560 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 3034 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-12 19:18:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-12 19:18:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 542. [2024-10-12 19:18:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 419 states have (on average 1.7088305489260143) internal successors, (716), 437 states have internal predecessors, (716), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (98), 94 states have call predecessors, (98), 96 states have call successors, (98) [2024-10-12 19:18:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 913 transitions. [2024-10-12 19:18:52,830 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 913 transitions. Word has length 76 [2024-10-12 19:18:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:52,831 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 913 transitions. [2024-10-12 19:18:52,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:18:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 913 transitions. [2024-10-12 19:18:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 19:18:52,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:52,834 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] [2024-10-12 19:18:52,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:18:52,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:52,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1694545189, now seen corresponding path program 1 times [2024-10-12 19:18:52,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:52,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185686955] [2024-10-12 19:18:52,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:52,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:18:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:18:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:18:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:18:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:18:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:18:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:18:53,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:53,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185686955] [2024-10-12 19:18:53,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185686955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:53,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:53,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:18:53,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266656732] [2024-10-12 19:18:53,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:53,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:18:53,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:53,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:18:53,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:53,378 INFO L87 Difference]: Start difference. First operand 542 states and 913 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:18:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:58,225 INFO L93 Difference]: Finished difference Result 1402 states and 2435 transitions. [2024-10-12 19:18:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:18:58,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76 [2024-10-12 19:18:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:58,234 INFO L225 Difference]: With dead ends: 1402 [2024-10-12 19:18:58,234 INFO L226 Difference]: Without dead ends: 841 [2024-10-12 19:18:58,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:18:58,240 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 2050 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:58,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 1447 Invalid, 3422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-12 19:18:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-10-12 19:18:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 519. [2024-10-12 19:18:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 399 states have (on average 1.699248120300752) internal successors, (678), 415 states have internal predecessors, (678), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-12 19:18:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 871 transitions. [2024-10-12 19:18:58,399 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 871 transitions. Word has length 76 [2024-10-12 19:18:58,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:58,400 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 871 transitions. [2024-10-12 19:18:58,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:18:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 871 transitions. [2024-10-12 19:18:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 19:18:58,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:58,402 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] [2024-10-12 19:18:58,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:18:58,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:58,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash 284735324, now seen corresponding path program 1 times [2024-10-12 19:18:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:58,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967656096] [2024-10-12 19:18:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:58,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:18:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:18:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:18:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:18:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:18:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:18:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:18:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:18:59,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:59,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967656096] [2024-10-12 19:18:59,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967656096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:59,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:59,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:18:59,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66324849] [2024-10-12 19:18:59,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:59,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:18:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:59,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:18:59,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:18:59,008 INFO L87 Difference]: Start difference. First operand 519 states and 871 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:04,900 INFO L93 Difference]: Finished difference Result 1366 states and 2367 transitions. [2024-10-12 19:19:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:19:04,901 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2024-10-12 19:19:04,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:04,906 INFO L225 Difference]: With dead ends: 1366 [2024-10-12 19:19:04,907 INFO L226 Difference]: Without dead ends: 835 [2024-10-12 19:19:04,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:19:04,910 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1586 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 5159 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 5592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 5159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:04,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 2624 Invalid, 5592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 5159 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-12 19:19:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-10-12 19:19:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 513. [2024-10-12 19:19:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 393 states have (on average 1.6921119592875318) internal successors, (665), 409 states have internal predecessors, (665), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-12 19:19:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 858 transitions. [2024-10-12 19:19:05,023 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 858 transitions. Word has length 77 [2024-10-12 19:19:05,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:05,023 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 858 transitions. [2024-10-12 19:19:05,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 858 transitions. [2024-10-12 19:19:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 19:19:05,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:05,025 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] [2024-10-12 19:19:05,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:19:05,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:05,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:05,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2123397328, now seen corresponding path program 1 times [2024-10-12 19:19:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:05,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268911223] [2024-10-12 19:19:05,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:05,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:19:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:19:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:19:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:19:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:19:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:05,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:05,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268911223] [2024-10-12 19:19:05,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268911223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:05,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:05,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426095654] [2024-10-12 19:19:05,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:05,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:05,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:05,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:05,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:05,645 INFO L87 Difference]: Start difference. First operand 513 states and 858 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:11,255 INFO L93 Difference]: Finished difference Result 1338 states and 2318 transitions. [2024-10-12 19:19:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:19:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 78 [2024-10-12 19:19:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:11,263 INFO L225 Difference]: With dead ends: 1338 [2024-10-12 19:19:11,263 INFO L226 Difference]: Without dead ends: 835 [2024-10-12 19:19:11,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 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-12 19:19:11,267 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 1973 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 5014 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 5614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 5014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:11,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 2762 Invalid, 5614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 5014 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 19:19:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-10-12 19:19:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 513. [2024-10-12 19:19:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 393 states have (on average 1.6895674300254453) internal successors, (664), 409 states have internal predecessors, (664), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-12 19:19:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 857 transitions. [2024-10-12 19:19:11,408 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 857 transitions. Word has length 78 [2024-10-12 19:19:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:11,409 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 857 transitions. [2024-10-12 19:19:11,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 857 transitions. [2024-10-12 19:19:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 19:19:11,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:11,411 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] [2024-10-12 19:19:11,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:19:11,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:11,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1366043847, now seen corresponding path program 1 times [2024-10-12 19:19:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:11,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215858190] [2024-10-12 19:19:11,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:19:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:12,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:19:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:12,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:19:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:12,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:19:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:19:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:12,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215858190] [2024-10-12 19:19:12,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215858190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:12,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:12,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:12,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324445488] [2024-10-12 19:19:12,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:12,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:12,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:12,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:12,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:12,026 INFO L87 Difference]: Start difference. First operand 513 states and 857 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:17,762 INFO L93 Difference]: Finished difference Result 1354 states and 2336 transitions. [2024-10-12 19:19:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:19:17,762 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 79 [2024-10-12 19:19:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:17,767 INFO L225 Difference]: With dead ends: 1354 [2024-10-12 19:19:17,767 INFO L226 Difference]: Without dead ends: 829 [2024-10-12 19:19:17,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:19:17,772 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 2009 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 5026 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 5632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 5026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:17,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 2762 Invalid, 5632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 5026 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 19:19:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-12 19:19:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 507. [2024-10-12 19:19:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 387 states have (on average 1.682170542635659) internal successors, (651), 403 states have internal predecessors, (651), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-12 19:19:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 844 transitions. [2024-10-12 19:19:17,898 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 844 transitions. Word has length 79 [2024-10-12 19:19:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:17,898 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 844 transitions. [2024-10-12 19:19:17,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 844 transitions. [2024-10-12 19:19:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:19:17,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:17,900 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] [2024-10-12 19:19:17,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:19:17,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:17,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2199410, now seen corresponding path program 1 times [2024-10-12 19:19:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:17,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71071987] [2024-10-12 19:19:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:19:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:19:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:19:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:19:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:19:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:18,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:18,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71071987] [2024-10-12 19:19:18,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71071987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:18,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:19:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274588461] [2024-10-12 19:19:18,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:18,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:19:18,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:18,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:19:18,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:19:18,478 INFO L87 Difference]: Start difference. First operand 507 states and 844 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:19:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:22,940 INFO L93 Difference]: Finished difference Result 1326 states and 2289 transitions. [2024-10-12 19:19:22,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:19:22,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2024-10-12 19:19:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:22,946 INFO L225 Difference]: With dead ends: 1326 [2024-10-12 19:19:22,946 INFO L226 Difference]: Without dead ends: 829 [2024-10-12 19:19:22,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:19:22,949 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 978 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 2798 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 2798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:22,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1555 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 2798 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-12 19:19:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-12 19:19:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 507. [2024-10-12 19:19:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 387 states have (on average 1.6795865633074936) internal successors, (650), 403 states have internal predecessors, (650), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-12 19:19:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 843 transitions. [2024-10-12 19:19:23,057 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 843 transitions. Word has length 80 [2024-10-12 19:19:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:23,057 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 843 transitions. [2024-10-12 19:19:23,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:19:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 843 transitions. [2024-10-12 19:19:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:19:23,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:23,060 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] [2024-10-12 19:19:23,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:19:23,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:23,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash -934786372, now seen corresponding path program 1 times [2024-10-12 19:19:23,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:23,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583614428] [2024-10-12 19:19:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:19:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:19:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:19:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:19:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:19:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:23,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:23,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583614428] [2024-10-12 19:19:23,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583614428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:23,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:23,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730820511] [2024-10-12 19:19:23,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:23,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:23,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:23,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:23,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:23,663 INFO L87 Difference]: Start difference. First operand 507 states and 843 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:29,031 INFO L93 Difference]: Finished difference Result 1336 states and 2298 transitions. [2024-10-12 19:19:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:19:29,032 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2024-10-12 19:19:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:29,036 INFO L225 Difference]: With dead ends: 1336 [2024-10-12 19:19:29,036 INFO L226 Difference]: Without dead ends: 839 [2024-10-12 19:19:29,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:19:29,038 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 1942 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 4920 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2044 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 5525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 4920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:29,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2044 Valid, 2774 Invalid, 5525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 4920 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-12 19:19:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-12 19:19:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 512. [2024-10-12 19:19:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 392 states have (on average 1.6709183673469388) internal successors, (655), 408 states have internal predecessors, (655), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-12 19:19:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 848 transitions. [2024-10-12 19:19:29,173 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 848 transitions. Word has length 81 [2024-10-12 19:19:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:29,173 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 848 transitions. [2024-10-12 19:19:29,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 848 transitions. [2024-10-12 19:19:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:19:29,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:29,176 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] [2024-10-12 19:19:29,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:19:29,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:29,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:29,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1270411229, now seen corresponding path program 1 times [2024-10-12 19:19:29,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:29,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623990389] [2024-10-12 19:19:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:29,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:19:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:19:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:19:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:19:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:19:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:29,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623990389] [2024-10-12 19:19:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623990389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:29,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:29,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204682948] [2024-10-12 19:19:29,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:29,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:29,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:29,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:29,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:29,755 INFO L87 Difference]: Start difference. First operand 512 states and 848 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:35,588 INFO L93 Difference]: Finished difference Result 1347 states and 2308 transitions. [2024-10-12 19:19:35,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:19:35,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2024-10-12 19:19:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:35,593 INFO L225 Difference]: With dead ends: 1347 [2024-10-12 19:19:35,594 INFO L226 Difference]: Without dead ends: 823 [2024-10-12 19:19:35,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:19:35,596 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 1478 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 5066 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 5486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 5066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:35,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 2791 Invalid, 5486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 5066 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 19:19:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-10-12 19:19:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 501. [2024-10-12 19:19:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 381 states have (on average 1.669291338582677) internal successors, (636), 397 states have internal predecessors, (636), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-12 19:19:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 829 transitions. [2024-10-12 19:19:35,711 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 829 transitions. Word has length 81 [2024-10-12 19:19:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:35,711 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 829 transitions. [2024-10-12 19:19:35,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 829 transitions. [2024-10-12 19:19:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 19:19:35,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:35,714 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] [2024-10-12 19:19:35,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:19:35,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:35,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash -954306505, now seen corresponding path program 1 times [2024-10-12 19:19:35,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:35,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565600230] [2024-10-12 19:19:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:19:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:19:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:19:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:19:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:19:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565600230] [2024-10-12 19:19:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565600230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:36,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:36,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:36,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270343298] [2024-10-12 19:19:36,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:36,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:36,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:36,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:36,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:36,306 INFO L87 Difference]: Start difference. First operand 501 states and 829 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:41,882 INFO L93 Difference]: Finished difference Result 1320 states and 2264 transitions. [2024-10-12 19:19:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:19:41,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2024-10-12 19:19:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:41,887 INFO L225 Difference]: With dead ends: 1320 [2024-10-12 19:19:41,887 INFO L226 Difference]: Without dead ends: 829 [2024-10-12 19:19:41,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:19:41,890 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1417 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 4915 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 5335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 4915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:41,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 2747 Invalid, 5335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 4915 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 19:19:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-12 19:19:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 507. [2024-10-12 19:19:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 387 states have (on average 1.6589147286821706) internal successors, (642), 403 states have internal predecessors, (642), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-12 19:19:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 835 transitions. [2024-10-12 19:19:42,051 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 835 transitions. Word has length 82 [2024-10-12 19:19:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:42,051 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 835 transitions. [2024-10-12 19:19:42,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 835 transitions. [2024-10-12 19:19:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 19:19:42,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:42,054 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] [2024-10-12 19:19:42,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:19:42,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:42,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:42,054 INFO L85 PathProgramCache]: Analyzing trace with hash -510405831, now seen corresponding path program 1 times [2024-10-12 19:19:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:42,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879835531] [2024-10-12 19:19:42,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:42,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:19:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:19:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:19:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:19:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:19:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:42,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:42,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879835531] [2024-10-12 19:19:42,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879835531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:42,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:42,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:42,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573199834] [2024-10-12 19:19:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:42,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:42,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:42,622 INFO L87 Difference]: Start difference. First operand 507 states and 835 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:48,446 INFO L93 Difference]: Finished difference Result 1328 states and 2270 transitions. [2024-10-12 19:19:48,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:19:48,446 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2024-10-12 19:19:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:48,452 INFO L225 Difference]: With dead ends: 1328 [2024-10-12 19:19:48,452 INFO L226 Difference]: Without dead ends: 823 [2024-10-12 19:19:48,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:19:48,455 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 951 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 5009 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 5253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 5009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:48,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 2879 Invalid, 5253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 5009 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-12 19:19:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-10-12 19:19:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 501. [2024-10-12 19:19:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 381 states have (on average 1.6666666666666667) internal successors, (635), 397 states have internal predecessors, (635), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-12 19:19:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 828 transitions. [2024-10-12 19:19:48,571 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 828 transitions. Word has length 82 [2024-10-12 19:19:48,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:48,571 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 828 transitions. [2024-10-12 19:19:48,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 828 transitions. [2024-10-12 19:19:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 19:19:48,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:48,573 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] [2024-10-12 19:19:48,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:19:48,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:48,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash -233715614, now seen corresponding path program 1 times [2024-10-12 19:19:48,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:48,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277867036] [2024-10-12 19:19:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:48,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:19:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:19:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:49,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:19:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:49,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:19:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:19:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:49,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277867036] [2024-10-12 19:19:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277867036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:49,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:49,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:19:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123648695] [2024-10-12 19:19:49,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:49,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:19:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:49,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:19:49,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:19:49,139 INFO L87 Difference]: Start difference. First operand 501 states and 828 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)