./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.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_spec2_product26.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 c39b0b488ad07619ca8d4ed9273747459006984c072c0894ad54004ae965569d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:17:17,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:17:17,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:17:17,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:17:17,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:17:17,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:17:17,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:17:17,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:17:17,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:17:17,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:17:17,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:17:17,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:17:17,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:17:17,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:17:17,233 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:17:17,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:17:17,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:17:17,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:17:17,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:17:17,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:17:17,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:17:17,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:17:17,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:17:17,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:17:17,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:17:17,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:17:17,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:17:17,241 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:17:17,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:17:17,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:17:17,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:17:17,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:17:17,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:17:17,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:17:17,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:17:17,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:17:17,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:17:17,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:17:17,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:17:17,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:17:17,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:17:17,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:17:17,245 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 -> c39b0b488ad07619ca8d4ed9273747459006984c072c0894ad54004ae965569d [2024-10-12 19:17:17,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:17:17,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:17:17,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:17:17,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:17:17,497 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:17:17,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c [2024-10-12 19:17:18,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:17:19,210 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:17:19,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c [2024-10-12 19:17:19,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17150e04c/e0b09798a94640c681b1e5fe855c9335/FLAG66f651f00 [2024-10-12 19:17:19,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17150e04c/e0b09798a94640c681b1e5fe855c9335 [2024-10-12 19:17:19,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:17:19,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:17:19,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:17:19,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:17:19,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:17:19,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:17:19" (1/1) ... [2024-10-12 19:17:19,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305cfaa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:19, skipping insertion in model container [2024-10-12 19:17:19,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:17:19" (1/1) ... [2024-10-12 19:17:19,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:17:20,098 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c[70298,70311] [2024-10-12 19:17:20,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:17:20,121 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:17:20,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-12 19:17:20,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [412] [2024-10-12 19:17:20,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1940] [2024-10-12 19:17:20,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2058] [2024-10-12 19:17:20,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2070] [2024-10-12 19:17:20,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2436] [2024-10-12 19:17:20,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2471] [2024-10-12 19:17:20,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3132] [2024-10-12 19:17:20,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3314] [2024-10-12 19:17:20,134 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3323] [2024-10-12 19:17:20,233 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c[70298,70311] [2024-10-12 19:17:20,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:17:20,264 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:17:20,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20 WrapperNode [2024-10-12 19:17:20,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:17:20,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:17:20,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:17:20,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:17:20,272 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:17:20" (1/1) ... [2024-10-12 19:17:20,308 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:17:20" (1/1) ... [2024-10-12 19:17:20,364 INFO L138 Inliner]: procedures = 93, calls = 340, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 860 [2024-10-12 19:17:20,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:17:20,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:17:20,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:17:20,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:17:20,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (1/1) ... [2024-10-12 19:17:20,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (1/1) ... [2024-10-12 19:17:20,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (1/1) ... [2024-10-12 19:17:20,425 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:17:20,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (1/1) ... [2024-10-12 19:17:20,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (1/1) ... [2024-10-12 19:17:20,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (1/1) ... [2024-10-12 19:17:20,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (1/1) ... [2024-10-12 19:17:20,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (1/1) ... [2024-10-12 19:17:20,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (1/1) ... [2024-10-12 19:17:20,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:17:20,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:17:20,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:17:20,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:17:20,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (1/1) ... [2024-10-12 19:17:20,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:17:20,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:17:20,501 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:17:20,503 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:17:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:17:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-12 19:17:20,546 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-12 19:17:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-12 19:17:20,546 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-12 19:17:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:17:20,546 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:17:20,547 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:17:20,547 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:17:20,547 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:17:20,547 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:17:20,547 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:17:20,548 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:17:20,548 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:17:20,548 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:17:20,548 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-12 19:17:20,548 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-12 19:17:20,548 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:17:20,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:17:20,549 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:17:20,549 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:17:20,549 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:17:20,549 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:17:20,550 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:17:20,550 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:17:20,550 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:17:20,550 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:17:20,550 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:17:20,550 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:17:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2024-10-12 19:17:20,551 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2024-10-12 19:17:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:17:20,551 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:17:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:17:20,551 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:17:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:17:20,551 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:17:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:17:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:17:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:17:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:17:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:17:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:17:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:17:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:17:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:17:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:17:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:17:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:17:20,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:17:20,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:17:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:17:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:17:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:17:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:17:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:17:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:17:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:17:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:17:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:17:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:17:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:17:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:17:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:17:20,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:17:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:17:20,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:17:20,728 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:17:20,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:17:21,856 INFO L? ?]: Removed 441 outVars from TransFormulas that were not future-live. [2024-10-12 19:17:21,857 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:17:21,946 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:17:21,959 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:17:21,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:17:21 BoogieIcfgContainer [2024-10-12 19:17:21,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:17:21,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:17:21,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:17:21,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:17:21,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:17:19" (1/3) ... [2024-10-12 19:17:21,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffe70de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:17:21, skipping insertion in model container [2024-10-12 19:17:21,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:20" (2/3) ... [2024-10-12 19:17:21,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffe70de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:17:21, skipping insertion in model container [2024-10-12 19:17:21,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:17:21" (3/3) ... [2024-10-12 19:17:21,969 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product26.cil.c [2024-10-12 19:17:21,982 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:17:21,982 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:17:22,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:17:22,069 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;@26248dd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:17:22,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:17:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 414 states have (on average 1.7439613526570048) internal successors, (722), 437 states have internal predecessors, (722), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-12 19:17:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 19:17:22,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:22,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:22,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:22,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1949591273, now seen corresponding path program 1 times [2024-10-12 19:17:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:22,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387183247] [2024-10-12 19:17:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:22,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:22,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:17:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:17:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387183247] [2024-10-12 19:17:23,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387183247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:23,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:23,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:23,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783348741] [2024-10-12 19:17:23,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:23,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:23,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:23,349 INFO L87 Difference]: Start difference. First operand has 529 states, 414 states have (on average 1.7439613526570048) internal successors, (722), 437 states have internal predecessors, (722), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:28,581 INFO L93 Difference]: Finished difference Result 1201 states and 2076 transitions. [2024-10-12 19:17:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:28,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2024-10-12 19:17:28,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:28,604 INFO L225 Difference]: With dead ends: 1201 [2024-10-12 19:17:28,604 INFO L226 Difference]: Without dead ends: 681 [2024-10-12 19:17:28,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:28,620 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 667 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:28,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1046 Invalid, 2837 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [122 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 19:17:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-12 19:17:28,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-12 19:17:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.733009708737864) internal successors, (714), 433 states have internal predecessors, (714), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 19:17:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 891 transitions. [2024-10-12 19:17:28,798 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 891 transitions. Word has length 46 [2024-10-12 19:17:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:28,800 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 891 transitions. [2024-10-12 19:17:28,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 891 transitions. [2024-10-12 19:17:28,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 19:17:28,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:28,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:28,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:17:28,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:28,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash 51341049, now seen corresponding path program 1 times [2024-10-12 19:17:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:28,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925616340] [2024-10-12 19:17:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:17:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:29,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:29,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925616340] [2024-10-12 19:17:29,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925616340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:29,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:29,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739173507] [2024-10-12 19:17:29,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:29,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:29,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:29,472 INFO L87 Difference]: Start difference. First operand 525 states and 891 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:33,841 INFO L93 Difference]: Finished difference Result 1194 states and 2049 transitions. [2024-10-12 19:17:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:33,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-10-12 19:17:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:33,848 INFO L225 Difference]: With dead ends: 1194 [2024-10-12 19:17:33,848 INFO L226 Difference]: Without dead ends: 681 [2024-10-12 19:17:33,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:33,852 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1091 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:33,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1056 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 19:17:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-12 19:17:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-12 19:17:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7305825242718447) internal successors, (713), 433 states have internal predecessors, (713), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 19:17:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 890 transitions. [2024-10-12 19:17:33,953 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 890 transitions. Word has length 48 [2024-10-12 19:17:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:33,953 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 890 transitions. [2024-10-12 19:17:33,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 890 transitions. [2024-10-12 19:17:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 19:17:33,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:33,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:33,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:17:33,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:33,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1225420843, now seen corresponding path program 1 times [2024-10-12 19:17:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861104165] [2024-10-12 19:17:33,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:17:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 19:17:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:34,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:34,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861104165] [2024-10-12 19:17:34,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861104165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:34,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:34,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823291545] [2024-10-12 19:17:34,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:34,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:34,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:34,572 INFO L87 Difference]: Start difference. First operand 525 states and 890 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:38,059 INFO L93 Difference]: Finished difference Result 1194 states and 2048 transitions. [2024-10-12 19:17:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:38,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-10-12 19:17:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:38,065 INFO L225 Difference]: With dead ends: 1194 [2024-10-12 19:17:38,065 INFO L226 Difference]: Without dead ends: 681 [2024-10-12 19:17:38,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:38,068 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1090 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2546 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:38,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1041 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2546 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 19:17:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-12 19:17:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-12 19:17:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7281553398058251) internal successors, (712), 433 states have internal predecessors, (712), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 19:17:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 889 transitions. [2024-10-12 19:17:38,160 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 889 transitions. Word has length 49 [2024-10-12 19:17:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:38,161 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 889 transitions. [2024-10-12 19:17:38,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 889 transitions. [2024-10-12 19:17:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:17:38,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:38,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:38,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:17:38,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:38,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1303040387, now seen corresponding path program 1 times [2024-10-12 19:17:38,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:38,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060069367] [2024-10-12 19:17:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:38,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:17:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:17:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:38,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:38,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060069367] [2024-10-12 19:17:38,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060069367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:38,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:38,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260034110] [2024-10-12 19:17:38,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:38,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:38,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:38,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:38,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:38,782 INFO L87 Difference]: Start difference. First operand 525 states and 889 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:42,918 INFO L93 Difference]: Finished difference Result 1194 states and 2047 transitions. [2024-10-12 19:17:42,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:42,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2024-10-12 19:17:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:42,924 INFO L225 Difference]: With dead ends: 1194 [2024-10-12 19:17:42,924 INFO L226 Difference]: Without dead ends: 681 [2024-10-12 19:17:42,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:42,927 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 661 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:42,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1058 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-12 19:17:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-12 19:17:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-12 19:17:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7257281553398058) internal successors, (711), 433 states have internal predecessors, (711), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 19:17:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 888 transitions. [2024-10-12 19:17:42,995 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 888 transitions. Word has length 50 [2024-10-12 19:17:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:42,995 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 888 transitions. [2024-10-12 19:17:42,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 888 transitions. [2024-10-12 19:17:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 19:17:42,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:42,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:42,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:17:42,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:42,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1433014489, now seen corresponding path program 1 times [2024-10-12 19:17:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:42,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385285406] [2024-10-12 19:17:42,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:17:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:17:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:43,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385285406] [2024-10-12 19:17:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385285406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:43,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:43,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:43,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47975734] [2024-10-12 19:17:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:43,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:43,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:43,515 INFO L87 Difference]: Start difference. First operand 525 states and 888 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:47,339 INFO L93 Difference]: Finished difference Result 1194 states and 2046 transitions. [2024-10-12 19:17:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:47,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2024-10-12 19:17:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:47,344 INFO L225 Difference]: With dead ends: 1194 [2024-10-12 19:17:47,344 INFO L226 Difference]: Without dead ends: 681 [2024-10-12 19:17:47,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:47,347 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 659 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:47,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1058 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2694 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 19:17:47,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-12 19:17:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2024-10-12 19:17:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7233009708737863) internal successors, (710), 433 states have internal predecessors, (710), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 19:17:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 887 transitions. [2024-10-12 19:17:47,434 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 887 transitions. Word has length 51 [2024-10-12 19:17:47,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:47,435 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 887 transitions. [2024-10-12 19:17:47,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 887 transitions. [2024-10-12 19:17:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:17:47,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:47,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:47,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:17:47,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:47,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1198663169, now seen corresponding path program 1 times [2024-10-12 19:17:47,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:47,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597544754] [2024-10-12 19:17:47,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:47,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:17:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:48,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:48,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:48,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:48,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597544754] [2024-10-12 19:17:48,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597544754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:48,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:48,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:48,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868443913] [2024-10-12 19:17:48,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:48,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:48,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:48,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:48,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:48,016 INFO L87 Difference]: Start difference. First operand 525 states and 887 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:51,577 INFO L93 Difference]: Finished difference Result 1164 states and 1985 transitions. [2024-10-12 19:17:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:51,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2024-10-12 19:17:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:51,582 INFO L225 Difference]: With dead ends: 1164 [2024-10-12 19:17:51,583 INFO L226 Difference]: Without dead ends: 691 [2024-10-12 19:17:51,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:17:51,586 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 719 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 2670 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:51,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1064 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2670 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 19:17:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-12 19:17:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 525. [2024-10-12 19:17:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7111650485436893) internal successors, (705), 433 states have internal predecessors, (705), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 19:17:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 882 transitions. [2024-10-12 19:17:51,661 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 882 transitions. Word has length 52 [2024-10-12 19:17:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:51,661 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 882 transitions. [2024-10-12 19:17:51,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 882 transitions. [2024-10-12 19:17:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:17:51,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:51,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:51,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:17:51,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:51,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:51,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1938051908, now seen corresponding path program 1 times [2024-10-12 19:17:51,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:51,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002566586] [2024-10-12 19:17:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:51,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:17:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002566586] [2024-10-12 19:17:52,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002566586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:52,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:52,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:52,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603722141] [2024-10-12 19:17:52,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:52,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:52,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:52,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:52,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:52,245 INFO L87 Difference]: Start difference. First operand 525 states and 882 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:55,403 INFO L93 Difference]: Finished difference Result 1164 states and 1980 transitions. [2024-10-12 19:17:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2024-10-12 19:17:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:55,407 INFO L225 Difference]: With dead ends: 1164 [2024-10-12 19:17:55,408 INFO L226 Difference]: Without dead ends: 691 [2024-10-12 19:17:55,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:17:55,410 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1144 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2497 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 2751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:55,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 1056 Invalid, 2751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2497 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:17:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-12 19:17:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 525. [2024-10-12 19:17:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.6990291262135921) internal successors, (700), 433 states have internal predecessors, (700), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 19:17:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 877 transitions. [2024-10-12 19:17:55,487 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 877 transitions. Word has length 53 [2024-10-12 19:17:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:55,487 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 877 transitions. [2024-10-12 19:17:55,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 877 transitions. [2024-10-12 19:17:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 19:17:55,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:55,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:55,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:17:55,489 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:55,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash -78208260, now seen corresponding path program 1 times [2024-10-12 19:17:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:55,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682331459] [2024-10-12 19:17:55,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:17:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:56,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:56,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682331459] [2024-10-12 19:17:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682331459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:56,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:17:56,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388139298] [2024-10-12 19:17:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:56,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:17:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:17:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:17:56,096 INFO L87 Difference]: Start difference. First operand 525 states and 877 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:18:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:01,420 INFO L93 Difference]: Finished difference Result 1170 states and 1985 transitions. [2024-10-12 19:18:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:18:01,421 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2024-10-12 19:18:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:01,427 INFO L225 Difference]: With dead ends: 1170 [2024-10-12 19:18:01,427 INFO L226 Difference]: Without dead ends: 705 [2024-10-12 19:18:01,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:18:01,431 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 735 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 4835 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 4956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 4835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:01,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1927 Invalid, 4956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 4835 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-12 19:18:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-12 19:18:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 537. [2024-10-12 19:18:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.6959619952494063) internal successors, (714), 444 states have internal predecessors, (714), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-12 19:18:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 895 transitions. [2024-10-12 19:18:01,523 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 895 transitions. Word has length 54 [2024-10-12 19:18:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:01,524 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 895 transitions. [2024-10-12 19:18:01,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:18:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 895 transitions. [2024-10-12 19:18:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 19:18:01,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:01,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:01,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:18:01,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:01,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:01,529 INFO L85 PathProgramCache]: Analyzing trace with hash -526904899, now seen corresponding path program 1 times [2024-10-12 19:18:01,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:01,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891658083] [2024-10-12 19:18:01,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:01,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:01,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:01,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:02,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:18:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:02,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:02,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:02,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:02,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891658083] [2024-10-12 19:18:02,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891658083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:02,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:02,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:02,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451873186] [2024-10-12 19:18:02,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:02,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:02,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:02,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:02,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:02,037 INFO L87 Difference]: Start difference. First operand 537 states and 895 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:18:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:05,428 INFO L93 Difference]: Finished difference Result 1192 states and 2023 transitions. [2024-10-12 19:18:05,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:18:05,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2024-10-12 19:18:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:05,434 INFO L225 Difference]: With dead ends: 1192 [2024-10-12 19:18:05,434 INFO L226 Difference]: Without dead ends: 711 [2024-10-12 19:18:05,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:05,437 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 717 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 2605 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:05,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1031 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2605 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 19:18:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-12 19:18:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 537. [2024-10-12 19:18:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.6840855106888362) internal successors, (709), 444 states have internal predecessors, (709), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-12 19:18:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 890 transitions. [2024-10-12 19:18:05,541 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 890 transitions. Word has length 54 [2024-10-12 19:18:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:05,542 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 890 transitions. [2024-10-12 19:18:05,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:18:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 890 transitions. [2024-10-12 19:18:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 19:18:05,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:05,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:05,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:18:05,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:05,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash -840479970, now seen corresponding path program 1 times [2024-10-12 19:18:05,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:05,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131441638] [2024-10-12 19:18:05,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:05,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:05,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:05,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:05,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:18:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:06,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:06,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:06,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131441638] [2024-10-12 19:18:06,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131441638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:06,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:06,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:18:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588241605] [2024-10-12 19:18:06,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:06,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:18:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:06,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:18:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:18:06,102 INFO L87 Difference]: Start difference. First operand 537 states and 890 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:18:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:11,038 INFO L93 Difference]: Finished difference Result 1172 states and 1981 transitions. [2024-10-12 19:18:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:18:11,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 55 [2024-10-12 19:18:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:11,044 INFO L225 Difference]: With dead ends: 1172 [2024-10-12 19:18:11,045 INFO L226 Difference]: Without dead ends: 705 [2024-10-12 19:18:11,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:18:11,047 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 708 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 4736 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 4858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 4736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:11,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1870 Invalid, 4858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 4736 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 19:18:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-12 19:18:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 537. [2024-10-12 19:18:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.6817102137767221) internal successors, (708), 444 states have internal predecessors, (708), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-12 19:18:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 889 transitions. [2024-10-12 19:18:11,129 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 889 transitions. Word has length 55 [2024-10-12 19:18:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:11,129 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 889 transitions. [2024-10-12 19:18:11,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:18:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 889 transitions. [2024-10-12 19:18:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 19:18:11,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:11,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:11,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:18:11,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:11,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1650034750, now seen corresponding path program 1 times [2024-10-12 19:18:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685201185] [2024-10-12 19:18:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:18:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:11,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:11,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685201185] [2024-10-12 19:18:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685201185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:11,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:11,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:11,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874750615] [2024-10-12 19:18:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:11,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:11,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:11,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:11,615 INFO L87 Difference]: Start difference. First operand 537 states and 889 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:18:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:14,678 INFO L93 Difference]: Finished difference Result 1192 states and 2014 transitions. [2024-10-12 19:18:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:18:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2024-10-12 19:18:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:14,683 INFO L225 Difference]: With dead ends: 1192 [2024-10-12 19:18:14,683 INFO L226 Difference]: Without dead ends: 711 [2024-10-12 19:18:14,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:14,686 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1142 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:14,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1045 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:18:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-12 19:18:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 537. [2024-10-12 19:18:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.669833729216152) internal successors, (703), 444 states have internal predecessors, (703), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-12 19:18:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 884 transitions. [2024-10-12 19:18:14,793 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 884 transitions. Word has length 55 [2024-10-12 19:18:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:14,794 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 884 transitions. [2024-10-12 19:18:14,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:18:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 884 transitions. [2024-10-12 19:18:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:18:14,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:14,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:14,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:18:14,795 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:14,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash -530432422, now seen corresponding path program 1 times [2024-10-12 19:18:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917126252] [2024-10-12 19:18:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:14,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:18:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:15,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917126252] [2024-10-12 19:18:15,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917126252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:15,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:15,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:18:15,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377730180] [2024-10-12 19:18:15,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:15,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:18:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:15,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:18:15,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:18:15,346 INFO L87 Difference]: Start difference. First operand 537 states and 884 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:18:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:19,938 INFO L93 Difference]: Finished difference Result 1180 states and 1984 transitions. [2024-10-12 19:18:19,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:18:19,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2024-10-12 19:18:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:19,943 INFO L225 Difference]: With dead ends: 1180 [2024-10-12 19:18:19,943 INFO L226 Difference]: Without dead ends: 711 [2024-10-12 19:18:19,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:18:19,945 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1128 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 4555 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 4810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 4555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:19,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 1882 Invalid, 4810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 4555 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 19:18:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-12 19:18:20,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 540. [2024-10-12 19:18:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 424 states have (on average 1.6627358490566038) internal successors, (705), 447 states have internal predecessors, (705), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-12 19:18:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 886 transitions. [2024-10-12 19:18:20,031 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 886 transitions. Word has length 56 [2024-10-12 19:18:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:20,031 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 886 transitions. [2024-10-12 19:18:20,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:18:20,031 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 886 transitions. [2024-10-12 19:18:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:18:20,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:20,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:20,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:18:20,033 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:20,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1248179832, now seen corresponding path program 1 times [2024-10-12 19:18:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:20,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604040059] [2024-10-12 19:18:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:20,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:18:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:20,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:20,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604040059] [2024-10-12 19:18:20,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604040059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:20,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:20,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260880011] [2024-10-12 19:18:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:20,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:20,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:20,472 INFO L87 Difference]: Start difference. First operand 540 states and 886 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:18:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:23,600 INFO L93 Difference]: Finished difference Result 1201 states and 2014 transitions. [2024-10-12 19:18:23,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:18:23,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2024-10-12 19:18:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:23,605 INFO L225 Difference]: With dead ends: 1201 [2024-10-12 19:18:23,605 INFO L226 Difference]: Without dead ends: 717 [2024-10-12 19:18:23,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:23,607 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1135 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:23,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1066 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 2435 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:18:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-12 19:18:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 540. [2024-10-12 19:18:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 424 states have (on average 1.650943396226415) internal successors, (700), 447 states have internal predecessors, (700), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-12 19:18:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 881 transitions. [2024-10-12 19:18:23,695 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 881 transitions. Word has length 56 [2024-10-12 19:18:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:23,696 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 881 transitions. [2024-10-12 19:18:23,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:18:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 881 transitions. [2024-10-12 19:18:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:18:23,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:23,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:23,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:18:23,698 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:23,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash -969477639, now seen corresponding path program 1 times [2024-10-12 19:18:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501373090] [2024-10-12 19:18:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:23,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:23,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:24,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:18:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:24,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:24,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:24,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501373090] [2024-10-12 19:18:24,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501373090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:24,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:24,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:18:24,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817035936] [2024-10-12 19:18:24,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:24,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:18:24,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:24,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:18:24,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:18:24,271 INFO L87 Difference]: Start difference. First operand 540 states and 881 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:18:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:29,053 INFO L93 Difference]: Finished difference Result 1188 states and 1985 transitions. [2024-10-12 19:18:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:18:29,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2024-10-12 19:18:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:29,058 INFO L225 Difference]: With dead ends: 1188 [2024-10-12 19:18:29,058 INFO L226 Difference]: Without dead ends: 719 [2024-10-12 19:18:29,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:18:29,060 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 699 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 4639 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 4765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 4639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:29,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1867 Invalid, 4765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 4639 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-12 19:18:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-10-12 19:18:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 544. [2024-10-12 19:18:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 428 states have (on average 1.6425233644859814) internal successors, (703), 451 states have internal predecessors, (703), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2024-10-12 19:18:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 884 transitions. [2024-10-12 19:18:29,140 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 884 transitions. Word has length 57 [2024-10-12 19:18:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:29,141 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 884 transitions. [2024-10-12 19:18:29,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:18:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 884 transitions. [2024-10-12 19:18:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:18:29,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:29,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:29,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:18:29,142 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:29,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:29,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1786895335, now seen corresponding path program 1 times [2024-10-12 19:18:29,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:29,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830213939] [2024-10-12 19:18:29,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:29,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:18:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:29,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:29,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830213939] [2024-10-12 19:18:29,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830213939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:29,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:29,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:29,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358319169] [2024-10-12 19:18:29,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:29,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:29,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:29,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:29,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:29,603 INFO L87 Difference]: Start difference. First operand 544 states and 884 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:18:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:32,941 INFO L93 Difference]: Finished difference Result 1239 states and 2044 transitions. [2024-10-12 19:18:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:18:32,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2024-10-12 19:18:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:32,947 INFO L225 Difference]: With dead ends: 1239 [2024-10-12 19:18:32,947 INFO L226 Difference]: Without dead ends: 689 [2024-10-12 19:18:32,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:18:32,949 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1077 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:32,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 1029 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:18:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-10-12 19:18:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 526. [2024-10-12 19:18:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.6513317191283292) internal successors, (682), 434 states have internal predecessors, (682), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 19:18:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 859 transitions. [2024-10-12 19:18:33,035 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 859 transitions. Word has length 57 [2024-10-12 19:18:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:33,035 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 859 transitions. [2024-10-12 19:18:33,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:18:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 859 transitions. [2024-10-12 19:18:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:18:33,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:33,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:33,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:18:33,037 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:33,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1139405205, now seen corresponding path program 1 times [2024-10-12 19:18:33,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:33,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625690650] [2024-10-12 19:18:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:33,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:33,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:18:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:33,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:33,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:33,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:33,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625690650] [2024-10-12 19:18:33,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625690650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:33,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:33,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:33,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589318310] [2024-10-12 19:18:33,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:33,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:33,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:33,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:33,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:33,593 INFO L87 Difference]: Start difference. First operand 526 states and 859 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:18:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:36,802 INFO L93 Difference]: Finished difference Result 1166 states and 1949 transitions. [2024-10-12 19:18:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:18:36,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2024-10-12 19:18:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:36,806 INFO L225 Difference]: With dead ends: 1166 [2024-10-12 19:18:36,806 INFO L226 Difference]: Without dead ends: 699 [2024-10-12 19:18:36,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:18:36,808 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1091 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 2652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:36,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1034 Invalid, 2652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 19:18:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-12 19:18:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 531. [2024-10-12 19:18:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 418 states have (on average 1.6435406698564594) internal successors, (687), 439 states have internal predecessors, (687), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 19:18:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 864 transitions. [2024-10-12 19:18:36,893 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 864 transitions. Word has length 58 [2024-10-12 19:18:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:36,894 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 864 transitions. [2024-10-12 19:18:36,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:18:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 864 transitions. [2024-10-12 19:18:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:18:36,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:36,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:36,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:18:36,895 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:36,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:36,896 INFO L85 PathProgramCache]: Analyzing trace with hash 434533446, now seen corresponding path program 1 times [2024-10-12 19:18:36,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:36,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557409169] [2024-10-12 19:18:36,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:36,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:37,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:18:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:37,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:37,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:37,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:37,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557409169] [2024-10-12 19:18:37,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557409169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:37,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:37,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:37,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522846863] [2024-10-12 19:18:37,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:37,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:37,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:37,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:37,368 INFO L87 Difference]: Start difference. First operand 531 states and 864 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)