./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/email_spec11_product10.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/email_spec11_product10.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 c9a35f77051831a79054d5620e487d68dd21285b0cc9c8ae29c469f997bd1ec7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:24:05,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:24:05,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:24:05,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:24:05,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:24:05,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:24:05,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:24:05,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:24:05,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:24:05,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:24:05,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:24:05,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:24:05,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:24:05,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:24:05,471 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:24:05,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:24:05,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:24:05,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:24:05,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:24:05,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:24:05,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:24:05,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:24:05,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:24:05,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:24:05,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:24:05,477 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:24:05,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:24:05,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:24:05,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:24:05,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:24:05,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:24:05,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:24:05,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:24:05,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:24:05,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:24:05,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:24:05,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:24:05,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:24:05,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:24:05,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:24:05,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:24:05,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:24:05,483 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 -> c9a35f77051831a79054d5620e487d68dd21285b0cc9c8ae29c469f997bd1ec7 [2024-10-12 19:24:05,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:24:05,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:24:05,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:24:05,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:24:05,753 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:24:05,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product10.cil.c [2024-10-12 19:24:07,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:24:07,519 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:24:07,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product10.cil.c [2024-10-12 19:24:07,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f27a597/77588ea2acb0433a81e1a5108cedc4c0/FLAG7ae0fb573 [2024-10-12 19:24:07,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f27a597/77588ea2acb0433a81e1a5108cedc4c0 [2024-10-12 19:24:07,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:24:07,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:24:07,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:24:07,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:24:07,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:24:07,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:24:07" (1/1) ... [2024-10-12 19:24:07,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de71cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:07, skipping insertion in model container [2024-10-12 19:24:07,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:24:07" (1/1) ... [2024-10-12 19:24:07,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:24:08,184 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/email_spec11_product10.cil.c[53446,53459] [2024-10-12 19:24:08,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:24:08,225 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:24:08,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2024-10-12 19:24:08,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [460] [2024-10-12 19:24:08,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [478] [2024-10-12 19:24:08,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1558] [2024-10-12 19:24:08,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1769] [2024-10-12 19:24:08,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1967] [2024-10-12 19:24:08,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [2333] [2024-10-12 19:24:08,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2354] [2024-10-12 19:24:08,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2363] [2024-10-12 19:24:08,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2504] [2024-10-12 19:24:08,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2567] [2024-10-12 19:24:08,333 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/email_spec11_product10.cil.c[53446,53459] [2024-10-12 19:24:08,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:24:08,387 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:24:08,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08 WrapperNode [2024-10-12 19:24:08,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:24:08,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:24:08,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:24:08,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:24:08,397 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:24:08" (1/1) ... [2024-10-12 19:24:08,421 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:24:08" (1/1) ... [2024-10-12 19:24:08,484 INFO L138 Inliner]: procedures = 110, calls = 121, calls flagged for inlining = 40, calls inlined = 33, statements flattened = 625 [2024-10-12 19:24:08,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:24:08,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:24:08,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:24:08,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:24:08,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (1/1) ... [2024-10-12 19:24:08,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (1/1) ... [2024-10-12 19:24:08,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (1/1) ... [2024-10-12 19:24:08,540 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-10-12 19:24:08,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (1/1) ... [2024-10-12 19:24:08,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (1/1) ... [2024-10-12 19:24:08,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (1/1) ... [2024-10-12 19:24:08,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (1/1) ... [2024-10-12 19:24:08,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (1/1) ... [2024-10-12 19:24:08,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (1/1) ... [2024-10-12 19:24:08,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:24:08,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:24:08,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:24:08,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:24:08,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (1/1) ... [2024-10-12 19:24:08,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:24:08,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:24:08,646 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:24:08,649 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:24:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-12 19:24:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-12 19:24:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-12 19:24:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-12 19:24:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-12 19:24:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-12 19:24:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-12 19:24:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-12 19:24:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-10-12 19:24:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-10-12 19:24:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-12 19:24:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-12 19:24:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:24:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-12 19:24:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-12 19:24:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-12 19:24:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-12 19:24:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-12 19:24:08,705 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-12 19:24:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:24:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:24:08,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:24:08,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:24:08,879 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:24:08,881 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:24:09,441 INFO L? ?]: Removed 197 outVars from TransFormulas that were not future-live. [2024-10-12 19:24:09,441 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:24:09,513 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:24:09,514 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:24:09,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:24:09 BoogieIcfgContainer [2024-10-12 19:24:09,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:24:09,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:24:09,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:24:09,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:24:09,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:24:07" (1/3) ... [2024-10-12 19:24:09,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265d5a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:24:09, skipping insertion in model container [2024-10-12 19:24:09,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:24:08" (2/3) ... [2024-10-12 19:24:09,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265d5a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:24:09, skipping insertion in model container [2024-10-12 19:24:09,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:24:09" (3/3) ... [2024-10-12 19:24:09,527 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec11_product10.cil.c [2024-10-12 19:24:09,544 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:24:09,544 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:24:09,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:24:09,630 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;@542ba747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:24:09,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:24:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 103 states have internal predecessors, (160), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 19:24:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 19:24:09,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:09,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:09,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:09,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1317821752, now seen corresponding path program 1 times [2024-10-12 19:24:09,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:09,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186125855] [2024-10-12 19:24:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:09,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:10,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:10,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:24:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:24:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:24:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:24:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:10,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:24:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:24:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:24:10,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:10,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186125855] [2024-10-12 19:24:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186125855] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:24:10,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322868819] [2024-10-12 19:24:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:10,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:24:10,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:24:10,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:24:10,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:24:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:10,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 19:24:10,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:24:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:24:10,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:24:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322868819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:10,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:24:10,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-12 19:24:10,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522484730] [2024-10-12 19:24:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:10,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:24:10,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:10,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:24:10,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:24:10,696 INFO L87 Difference]: Start difference. First operand has 131 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 103 states have internal predecessors, (160), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:10,783 INFO L93 Difference]: Finished difference Result 216 states and 316 transitions. [2024-10-12 19:24:10,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:24:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-10-12 19:24:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:10,796 INFO L225 Difference]: With dead ends: 216 [2024-10-12 19:24:10,798 INFO L226 Difference]: Without dead ends: 128 [2024-10-12 19:24:10,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:24:10,808 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:10,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:24:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-12 19:24:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-12 19:24:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 99 states have (on average 1.5454545454545454) internal successors, (153), 100 states have internal predecessors, (153), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 19:24:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2024-10-12 19:24:10,869 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 60 [2024-10-12 19:24:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:10,872 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2024-10-12 19:24:10,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2024-10-12 19:24:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 19:24:10,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:10,877 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:10,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 19:24:11,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-12 19:24:11,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:11,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:11,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1413938838, now seen corresponding path program 1 times [2024-10-12 19:24:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:11,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077324834] [2024-10-12 19:24:11,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:11,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:11,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:11,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:24:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:11,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:24:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:24:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:24:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:24:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:11,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:24:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:24:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:11,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077324834] [2024-10-12 19:24:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077324834] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:24:11,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948086897] [2024-10-12 19:24:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:11,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:24:11,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:24:11,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:24:11,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:24:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:11,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:24:11,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:24:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:24:11,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:24:11,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948086897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:11,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:24:11,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-12 19:24:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160224068] [2024-10-12 19:24:11,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:11,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:24:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:11,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:24:11,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:24:11,644 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:11,694 INFO L93 Difference]: Finished difference Result 212 states and 303 transitions. [2024-10-12 19:24:11,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:24:11,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2024-10-12 19:24:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:11,696 INFO L225 Difference]: With dead ends: 212 [2024-10-12 19:24:11,697 INFO L226 Difference]: Without dead ends: 130 [2024-10-12 19:24:11,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:24:11,699 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:11,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:24:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-12 19:24:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-12 19:24:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.5346534653465347) internal successors, (155), 102 states have internal predecessors, (155), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 19:24:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2024-10-12 19:24:11,722 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 61 [2024-10-12 19:24:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:11,723 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2024-10-12 19:24:11,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2024-10-12 19:24:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 19:24:11,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:11,726 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:11,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 19:24:11,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-12 19:24:11,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:11,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2038153332, now seen corresponding path program 1 times [2024-10-12 19:24:11,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:11,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780747357] [2024-10-12 19:24:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:24:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:24:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:24:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:24:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:24:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:24:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:24:12,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:12,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780747357] [2024-10-12 19:24:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780747357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:24:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527197686] [2024-10-12 19:24:12,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:12,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:24:12,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:24:12,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:24:12,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:24:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:24:12,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:24:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 19:24:12,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:24:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527197686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:12,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:24:12,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-12 19:24:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170949982] [2024-10-12 19:24:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:12,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:24:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:24:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:24:12,468 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:24:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:12,556 INFO L93 Difference]: Finished difference Result 257 states and 381 transitions. [2024-10-12 19:24:12,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:24:12,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2024-10-12 19:24:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:12,559 INFO L225 Difference]: With dead ends: 257 [2024-10-12 19:24:12,559 INFO L226 Difference]: Without dead ends: 132 [2024-10-12 19:24:12,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:24:12,561 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 2 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:12,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 665 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:24:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-12 19:24:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-12 19:24:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 104 states have internal predecessors, (156), 19 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2024-10-12 19:24:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2024-10-12 19:24:12,573 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 195 transitions. Word has length 65 [2024-10-12 19:24:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:12,573 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 195 transitions. [2024-10-12 19:24:12,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:24:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2024-10-12 19:24:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 19:24:12,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:12,576 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:12,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 19:24:12,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:24:12,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:12,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash 219881415, now seen corresponding path program 1 times [2024-10-12 19:24:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090312963] [2024-10-12 19:24:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:12,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:24:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:24:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:24:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:24:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:24:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:24:12,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090312963] [2024-10-12 19:24:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090312963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:12,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:12,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:24:12,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876604605] [2024-10-12 19:24:12,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:12,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:24:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:12,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:24:12,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:24:12,966 INFO L87 Difference]: Start difference. First operand 132 states and 195 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:24:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:14,009 INFO L93 Difference]: Finished difference Result 354 states and 541 transitions. [2024-10-12 19:24:14,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:24:14,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 66 [2024-10-12 19:24:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:14,012 INFO L225 Difference]: With dead ends: 354 [2024-10-12 19:24:14,012 INFO L226 Difference]: Without dead ends: 237 [2024-10-12 19:24:14,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:24:14,014 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 279 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:14,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 455 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:24:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-12 19:24:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 132. [2024-10-12 19:24:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 104 states have internal predecessors, (156), 19 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2024-10-12 19:24:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2024-10-12 19:24:14,041 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 66 [2024-10-12 19:24:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:14,042 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2024-10-12 19:24:14,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:24:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2024-10-12 19:24:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 19:24:14,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:14,044 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:14,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:24:14,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:14,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:14,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1923971428, now seen corresponding path program 2 times [2024-10-12 19:24:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:14,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265372912] [2024-10-12 19:24:14,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:14,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:14,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:14,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:14,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:14,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:24:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:24:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:14,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:24:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:14,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:24:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:14,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:24:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:24:14,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265372912] [2024-10-12 19:24:14,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265372912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:14,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:14,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:24:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279779432] [2024-10-12 19:24:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:14,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:24:14,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:24:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:24:14,253 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:24:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:15,318 INFO L93 Difference]: Finished difference Result 356 states and 544 transitions. [2024-10-12 19:24:15,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:24:15,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2024-10-12 19:24:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:15,321 INFO L225 Difference]: With dead ends: 356 [2024-10-12 19:24:15,322 INFO L226 Difference]: Without dead ends: 239 [2024-10-12 19:24:15,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:24:15,323 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 278 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:15,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 454 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:24:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-12 19:24:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 134. [2024-10-12 19:24:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 103 states have (on average 1.5242718446601942) internal successors, (157), 106 states have internal predecessors, (157), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2024-10-12 19:24:15,360 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 67 [2024-10-12 19:24:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:15,360 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2024-10-12 19:24:15,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:24:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2024-10-12 19:24:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 19:24:15,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:15,362 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:15,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:24:15,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:15,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:15,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1122609812, now seen corresponding path program 1 times [2024-10-12 19:24:15,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:15,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348571625] [2024-10-12 19:24:15,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:15,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:15,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:15,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:15,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:24:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:24:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:15,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:24:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:24:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:15,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:24:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:15,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:15,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348571625] [2024-10-12 19:24:15,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348571625] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:24:15,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664566272] [2024-10-12 19:24:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:15,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:24:15,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:24:15,513 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:24:15,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 19:24:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:15,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:24:15,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:24:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:15,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:24:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:15,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664566272] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:24:15,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:24:15,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-12 19:24:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592366760] [2024-10-12 19:24:15,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:24:15,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:24:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:15,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:24:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:15,788 INFO L87 Difference]: Start difference. First operand 134 states and 197 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:24:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:16,580 INFO L93 Difference]: Finished difference Result 432 states and 689 transitions. [2024-10-12 19:24:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:24:16,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 68 [2024-10-12 19:24:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:16,584 INFO L225 Difference]: With dead ends: 432 [2024-10-12 19:24:16,584 INFO L226 Difference]: Without dead ends: 350 [2024-10-12 19:24:16,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:24:16,586 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 630 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:16,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 503 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:24:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-12 19:24:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 230. [2024-10-12 19:24:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 199 states have (on average 1.693467336683417) internal successors, (337), 202 states have internal predecessors, (337), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 377 transitions. [2024-10-12 19:24:16,614 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 377 transitions. Word has length 68 [2024-10-12 19:24:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:16,614 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 377 transitions. [2024-10-12 19:24:16,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:24:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 377 transitions. [2024-10-12 19:24:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 19:24:16,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:16,621 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:16,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 19:24:16,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:24:16,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:16,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1863339586, now seen corresponding path program 1 times [2024-10-12 19:24:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:16,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127181773] [2024-10-12 19:24:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:16,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:16,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:16,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:16,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:24:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:16,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:24:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:16,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:24:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:24:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:24:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:16,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:16,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127181773] [2024-10-12 19:24:16,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127181773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:16,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110606675] [2024-10-12 19:24:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:16,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:16,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:16,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:16,936 INFO L87 Difference]: Start difference. First operand 230 states and 377 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:17,616 INFO L93 Difference]: Finished difference Result 643 states and 1082 transitions. [2024-10-12 19:24:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:17,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2024-10-12 19:24:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:17,622 INFO L225 Difference]: With dead ends: 643 [2024-10-12 19:24:17,622 INFO L226 Difference]: Without dead ends: 435 [2024-10-12 19:24:17,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:17,627 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 338 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:17,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 324 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:24:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-12 19:24:17,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 325. [2024-10-12 19:24:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 294 states have (on average 1.7346938775510203) internal successors, (510), 297 states have internal predecessors, (510), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 550 transitions. [2024-10-12 19:24:17,668 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 550 transitions. Word has length 75 [2024-10-12 19:24:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:17,670 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 550 transitions. [2024-10-12 19:24:17,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 550 transitions. [2024-10-12 19:24:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 19:24:17,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:17,674 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:17,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:24:17,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:17,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1859154860, now seen corresponding path program 1 times [2024-10-12 19:24:17,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519622358] [2024-10-12 19:24:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:17,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:17,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:24:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:24:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:17,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:24:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:17,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:24:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:24:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:17,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:17,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519622358] [2024-10-12 19:24:17,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519622358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:17,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:17,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:17,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281834289] [2024-10-12 19:24:17,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:17,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:17,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:17,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:17,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:17,766 INFO L87 Difference]: Start difference. First operand 325 states and 550 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:18,467 INFO L93 Difference]: Finished difference Result 860 states and 1480 transitions. [2024-10-12 19:24:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:18,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2024-10-12 19:24:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:18,472 INFO L225 Difference]: With dead ends: 860 [2024-10-12 19:24:18,472 INFO L226 Difference]: Without dead ends: 572 [2024-10-12 19:24:18,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:18,474 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 337 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:18,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 318 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:24:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-12 19:24:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 462. [2024-10-12 19:24:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 431 states have (on average 1.7563805104408352) internal successors, (757), 434 states have internal predecessors, (757), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 797 transitions. [2024-10-12 19:24:18,498 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 797 transitions. Word has length 76 [2024-10-12 19:24:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:18,499 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 797 transitions. [2024-10-12 19:24:18,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 797 transitions. [2024-10-12 19:24:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 19:24:18,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:18,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:18,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:24:18,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:18,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1380626268, now seen corresponding path program 1 times [2024-10-12 19:24:18,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:18,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496510488] [2024-10-12 19:24:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:18,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:18,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:24:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:24:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:18,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:24:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:18,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:24:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:24:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:18,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:18,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496510488] [2024-10-12 19:24:18,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496510488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:18,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:18,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410648128] [2024-10-12 19:24:18,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:18,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:18,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:18,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:18,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:18,588 INFO L87 Difference]: Start difference. First operand 462 states and 797 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:19,288 INFO L93 Difference]: Finished difference Result 1218 states and 2126 transitions. [2024-10-12 19:24:19,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:19,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2024-10-12 19:24:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:19,293 INFO L225 Difference]: With dead ends: 1218 [2024-10-12 19:24:19,294 INFO L226 Difference]: Without dead ends: 810 [2024-10-12 19:24:19,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:19,297 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 333 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:19,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 324 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:24:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2024-10-12 19:24:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 700. [2024-10-12 19:24:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 669 states have (on average 1.7608370702541105) internal successors, (1178), 672 states have internal predecessors, (1178), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1218 transitions. [2024-10-12 19:24:19,331 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1218 transitions. Word has length 77 [2024-10-12 19:24:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:19,331 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1218 transitions. [2024-10-12 19:24:19,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1218 transitions. [2024-10-12 19:24:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 19:24:19,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:19,333 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:19,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:24:19,334 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:19,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1921345826, now seen corresponding path program 1 times [2024-10-12 19:24:19,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:19,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715889691] [2024-10-12 19:24:19,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:19,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:19,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:24:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:19,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:24:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:19,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:24:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:24:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:19,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:24:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:19,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:19,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715889691] [2024-10-12 19:24:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715889691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:19,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096361427] [2024-10-12 19:24:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:19,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:19,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:19,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:19,445 INFO L87 Difference]: Start difference. First operand 700 states and 1218 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:20,142 INFO L93 Difference]: Finished difference Result 1795 states and 3154 transitions. [2024-10-12 19:24:20,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-10-12 19:24:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:20,154 INFO L225 Difference]: With dead ends: 1795 [2024-10-12 19:24:20,154 INFO L226 Difference]: Without dead ends: 1192 [2024-10-12 19:24:20,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:20,157 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 330 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:20,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 320 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:24:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-10-12 19:24:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1082. [2024-10-12 19:24:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1051 states have (on average 1.7554709800190296) internal successors, (1845), 1054 states have internal predecessors, (1845), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1885 transitions. [2024-10-12 19:24:20,203 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1885 transitions. Word has length 78 [2024-10-12 19:24:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:20,203 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1885 transitions. [2024-10-12 19:24:20,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1885 transitions. [2024-10-12 19:24:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 19:24:20,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:20,207 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:20,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:24:20,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:20,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1979010438, now seen corresponding path program 1 times [2024-10-12 19:24:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:20,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873350682] [2024-10-12 19:24:20,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:20,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:20,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:24:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:20,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:24:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:20,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:24:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:24:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:20,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:24:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873350682] [2024-10-12 19:24:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873350682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:20,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029207734] [2024-10-12 19:24:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:20,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:20,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:20,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:20,301 INFO L87 Difference]: Start difference. First operand 1082 states and 1885 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:20,987 INFO L93 Difference]: Finished difference Result 2736 states and 4815 transitions. [2024-10-12 19:24:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:20,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2024-10-12 19:24:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:20,995 INFO L225 Difference]: With dead ends: 2736 [2024-10-12 19:24:20,995 INFO L226 Difference]: Without dead ends: 1824 [2024-10-12 19:24:20,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:20,998 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 329 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:20,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 321 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:24:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2024-10-12 19:24:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1714. [2024-10-12 19:24:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1683 states have (on average 1.7462863933452168) internal successors, (2939), 1686 states have internal predecessors, (2939), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2979 transitions. [2024-10-12 19:24:21,053 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2979 transitions. Word has length 79 [2024-10-12 19:24:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:21,054 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2979 transitions. [2024-10-12 19:24:21,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2979 transitions. [2024-10-12 19:24:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:24:21,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:21,058 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:21,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:24:21,058 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:21,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash 812762702, now seen corresponding path program 2 times [2024-10-12 19:24:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:21,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784418763] [2024-10-12 19:24:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:24:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:24:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:21,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:24:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:24:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:21,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:24:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-12 19:24:21,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:21,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784418763] [2024-10-12 19:24:21,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784418763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:21,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:21,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:21,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022703812] [2024-10-12 19:24:21,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:21,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:21,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:21,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:21,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:21,173 INFO L87 Difference]: Start difference. First operand 1714 states and 2979 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:21,906 INFO L93 Difference]: Finished difference Result 3030 states and 5272 transitions. [2024-10-12 19:24:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:21,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-10-12 19:24:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:21,914 INFO L225 Difference]: With dead ends: 3030 [2024-10-12 19:24:21,914 INFO L226 Difference]: Without dead ends: 1824 [2024-10-12 19:24:21,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:21,916 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 334 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:21,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 547 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:24:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2024-10-12 19:24:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1714. [2024-10-12 19:24:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1683 states have (on average 1.7332144979203803) internal successors, (2917), 1686 states have internal predecessors, (2917), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2957 transitions. [2024-10-12 19:24:21,971 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2957 transitions. Word has length 80 [2024-10-12 19:24:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:21,971 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2957 transitions. [2024-10-12 19:24:21,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2957 transitions. [2024-10-12 19:24:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:24:21,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:21,976 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:21,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:24:21,977 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:21,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash 997459460, now seen corresponding path program 1 times [2024-10-12 19:24:21,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:21,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299803799] [2024-10-12 19:24:21,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:21,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:24:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:24:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:24:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:24:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:24:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:22,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299803799] [2024-10-12 19:24:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299803799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:22,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:22,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:22,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161190826] [2024-10-12 19:24:22,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:22,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:22,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:22,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:22,081 INFO L87 Difference]: Start difference. First operand 1714 states and 2957 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:22,824 INFO L93 Difference]: Finished difference Result 4125 states and 7193 transitions. [2024-10-12 19:24:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:22,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-10-12 19:24:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:22,835 INFO L225 Difference]: With dead ends: 4125 [2024-10-12 19:24:22,837 INFO L226 Difference]: Without dead ends: 2756 [2024-10-12 19:24:22,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:22,840 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 324 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:22,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 322 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:24:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2024-10-12 19:24:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 2646. [2024-10-12 19:24:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 2615 states have (on average 1.7204588910133842) internal successors, (4499), 2618 states have internal predecessors, (4499), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 4539 transitions. [2024-10-12 19:24:22,929 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 4539 transitions. Word has length 80 [2024-10-12 19:24:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:22,932 INFO L471 AbstractCegarLoop]: Abstraction has 2646 states and 4539 transitions. [2024-10-12 19:24:22,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 4539 transitions. [2024-10-12 19:24:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:24:22,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:22,939 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:22,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:24:22,939 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:22,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1519850088, now seen corresponding path program 1 times [2024-10-12 19:24:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:22,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437232708] [2024-10-12 19:24:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:22,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:22,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:23,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:24:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:23,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:24:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:24:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:23,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:24:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:24:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:23,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:23,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437232708] [2024-10-12 19:24:23,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437232708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:23,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:23,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:23,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755027680] [2024-10-12 19:24:23,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:23,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:23,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:23,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:23,027 INFO L87 Difference]: Start difference. First operand 2646 states and 4539 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:23,784 INFO L93 Difference]: Finished difference Result 6714 states and 11644 transitions. [2024-10-12 19:24:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2024-10-12 19:24:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:23,804 INFO L225 Difference]: With dead ends: 6714 [2024-10-12 19:24:23,805 INFO L226 Difference]: Without dead ends: 4570 [2024-10-12 19:24:23,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:23,810 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 325 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:23,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 321 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:24:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2024-10-12 19:24:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 4460. [2024-10-12 19:24:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4460 states, 4429 states have (on average 1.7078347256717092) internal successors, (7564), 4432 states have internal predecessors, (7564), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4460 states to 4460 states and 7604 transitions. [2024-10-12 19:24:23,947 INFO L78 Accepts]: Start accepts. Automaton has 4460 states and 7604 transitions. Word has length 81 [2024-10-12 19:24:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:23,947 INFO L471 AbstractCegarLoop]: Abstraction has 4460 states and 7604 transitions. [2024-10-12 19:24:23,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 4460 states and 7604 transitions. [2024-10-12 19:24:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 19:24:23,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:23,959 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:23,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:24:23,959 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:23,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1262187694, now seen corresponding path program 1 times [2024-10-12 19:24:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:23,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579219824] [2024-10-12 19:24:23,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:24,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:24:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:24:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:24:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:24,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:24:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:24,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:24:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:24,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:24,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579219824] [2024-10-12 19:24:24,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579219824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:24,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:24,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:24,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482090154] [2024-10-12 19:24:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:24,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:24,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:24,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:24,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:24,053 INFO L87 Difference]: Start difference. First operand 4460 states and 7604 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:24,858 INFO L93 Difference]: Finished difference Result 11623 states and 20003 transitions. [2024-10-12 19:24:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:24,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2024-10-12 19:24:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:24,893 INFO L225 Difference]: With dead ends: 11623 [2024-10-12 19:24:24,893 INFO L226 Difference]: Without dead ends: 7900 [2024-10-12 19:24:24,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:24,903 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 321 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:24,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 322 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:24:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2024-10-12 19:24:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7790. [2024-10-12 19:24:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7790 states, 7759 states have (on average 1.6936460884134554) internal successors, (13141), 7762 states have internal predecessors, (13141), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 13181 transitions. [2024-10-12 19:24:25,147 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 13181 transitions. Word has length 82 [2024-10-12 19:24:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:25,148 INFO L471 AbstractCegarLoop]: Abstraction has 7790 states and 13181 transitions. [2024-10-12 19:24:25,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 13181 transitions. [2024-10-12 19:24:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 19:24:25,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:25,159 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:25,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:24:25,160 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:25,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash 177557046, now seen corresponding path program 1 times [2024-10-12 19:24:25,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:25,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556605864] [2024-10-12 19:24:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:25,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:25,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:24:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:25,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:24:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:25,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:24:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:24:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:25,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:24:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:25,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556605864] [2024-10-12 19:24:25,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556605864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:25,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:25,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:25,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463517455] [2024-10-12 19:24:25,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:25,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:25,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:25,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:25,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:25,245 INFO L87 Difference]: Start difference. First operand 7790 states and 13181 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:26,156 INFO L93 Difference]: Finished difference Result 20908 states and 35626 transitions. [2024-10-12 19:24:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2024-10-12 19:24:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:26,206 INFO L225 Difference]: With dead ends: 20908 [2024-10-12 19:24:26,207 INFO L226 Difference]: Without dead ends: 14156 [2024-10-12 19:24:26,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:26,217 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 318 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:26,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 322 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:24:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2024-10-12 19:24:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 14046. [2024-10-12 19:24:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14046 states, 14015 states have (on average 1.6768462361755263) internal successors, (23501), 14018 states have internal predecessors, (23501), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14046 states to 14046 states and 23541 transitions. [2024-10-12 19:24:26,615 INFO L78 Accepts]: Start accepts. Automaton has 14046 states and 23541 transitions. Word has length 83 [2024-10-12 19:24:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:26,615 INFO L471 AbstractCegarLoop]: Abstraction has 14046 states and 23541 transitions. [2024-10-12 19:24:26,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 14046 states and 23541 transitions. [2024-10-12 19:24:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 19:24:26,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:26,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:26,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:24:26,633 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:26,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1260741964, now seen corresponding path program 1 times [2024-10-12 19:24:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:26,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713347329] [2024-10-12 19:24:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:26,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:24:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:26,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:24:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:26,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:24:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:24:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:26,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:24:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:26,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713347329] [2024-10-12 19:24:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713347329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:26,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:26,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358843922] [2024-10-12 19:24:26,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:26,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:26,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:26,713 INFO L87 Difference]: Start difference. First operand 14046 states and 23541 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:27,798 INFO L93 Difference]: Finished difference Result 38725 states and 65188 transitions. [2024-10-12 19:24:27,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:27,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2024-10-12 19:24:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:27,871 INFO L225 Difference]: With dead ends: 38725 [2024-10-12 19:24:27,871 INFO L226 Difference]: Without dead ends: 26092 [2024-10-12 19:24:27,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:27,885 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 317 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:27,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 326 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:24:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26092 states. [2024-10-12 19:24:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26092 to 25982. [2024-10-12 19:24:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25982 states, 25951 states have (on average 1.656776232129783) internal successors, (42995), 25954 states have internal predecessors, (42995), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25982 states to 25982 states and 43035 transitions. [2024-10-12 19:24:28,882 INFO L78 Accepts]: Start accepts. Automaton has 25982 states and 43035 transitions. Word has length 84 [2024-10-12 19:24:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:28,882 INFO L471 AbstractCegarLoop]: Abstraction has 25982 states and 43035 transitions. [2024-10-12 19:24:28,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 25982 states and 43035 transitions. [2024-10-12 19:24:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 19:24:28,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:28,927 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:28,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:24:28,928 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:28,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:28,928 INFO L85 PathProgramCache]: Analyzing trace with hash 187582164, now seen corresponding path program 1 times [2024-10-12 19:24:28,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:28,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676371398] [2024-10-12 19:24:28,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:28,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:29,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:24:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:29,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:24:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:29,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:24:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:29,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:24:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:29,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:24:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:29,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:29,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676371398] [2024-10-12 19:24:29,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676371398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:29,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:29,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:24:29,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444939183] [2024-10-12 19:24:29,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:29,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:24:29,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:29,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:24:29,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:24:29,101 INFO L87 Difference]: Start difference. First operand 25982 states and 43035 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:30,241 INFO L93 Difference]: Finished difference Result 49141 states and 81333 transitions. [2024-10-12 19:24:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:24:30,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2024-10-12 19:24:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:30,388 INFO L225 Difference]: With dead ends: 49141 [2024-10-12 19:24:30,388 INFO L226 Difference]: Without dead ends: 49059 [2024-10-12 19:24:30,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:24:30,403 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 317 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:30,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 327 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:24:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49059 states. [2024-10-12 19:24:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49059 to 48949. [2024-10-12 19:24:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48949 states, 48918 states have (on average 1.6335500224866102) internal successors, (79910), 48921 states have internal predecessors, (79910), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-12 19:24:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48949 states to 48949 states and 79950 transitions. [2024-10-12 19:24:31,974 INFO L78 Accepts]: Start accepts. Automaton has 48949 states and 79950 transitions. Word has length 85 [2024-10-12 19:24:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:31,974 INFO L471 AbstractCegarLoop]: Abstraction has 48949 states and 79950 transitions. [2024-10-12 19:24:31,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:24:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 48949 states and 79950 transitions. [2024-10-12 19:24:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 19:24:32,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:32,001 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:32,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:24:32,001 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:32,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1920916970, now seen corresponding path program 1 times [2024-10-12 19:24:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:32,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634520718] [2024-10-12 19:24:32,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:32,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:32,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:24:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:32,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:24:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:24:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:32,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:24:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:32,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:24:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:24:32,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:32,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634520718] [2024-10-12 19:24:32,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634520718] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:24:32,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912068737] [2024-10-12 19:24:32,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:32,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:24:32,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:24:32,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:24:32,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 19:24:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:32,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 19:24:32,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:24:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 19:24:33,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:24:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912068737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:33,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:24:33,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2024-10-12 19:24:33,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974570537] [2024-10-12 19:24:33,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:33,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:24:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:33,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:24:33,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2024-10-12 19:24:33,047 INFO L87 Difference]: Start difference. First operand 48949 states and 79950 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 5 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 19:24:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:33,965 INFO L93 Difference]: Finished difference Result 49123 states and 80188 transitions. [2024-10-12 19:24:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:24:33,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 5 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 86 [2024-10-12 19:24:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:34,090 INFO L225 Difference]: With dead ends: 49123 [2024-10-12 19:24:34,090 INFO L226 Difference]: Without dead ends: 49046 [2024-10-12 19:24:34,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 19:24:34,113 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 295 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:34,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1547 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:24:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49046 states. [2024-10-12 19:24:35,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49046 to 49034. [2024-10-12 19:24:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49034 states, 48980 states have (on average 1.6332380563495303) internal successors, (79996), 48983 states have internal predecessors, (79996), 32 states have call successors, (32), 17 states have call predecessors, (32), 21 states have return successors, (40), 33 states have call predecessors, (40), 30 states have call successors, (40) [2024-10-12 19:24:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49034 states to 49034 states and 80068 transitions. [2024-10-12 19:24:35,639 INFO L78 Accepts]: Start accepts. Automaton has 49034 states and 80068 transitions. Word has length 86 [2024-10-12 19:24:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:35,640 INFO L471 AbstractCegarLoop]: Abstraction has 49034 states and 80068 transitions. [2024-10-12 19:24:35,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 5 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 19:24:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 49034 states and 80068 transitions. [2024-10-12 19:24:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 19:24:35,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:24:35,663 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:35,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 19:24:35,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:24:35,867 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:24:35,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:24:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash 829827647, now seen corresponding path program 1 times [2024-10-12 19:24:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:24:35,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080965323] [2024-10-12 19:24:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:24:35,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:24:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:35,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:24:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:35,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:24:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:35,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:24:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:24:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:35,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:24:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:24:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:35,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:24:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:35,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:24:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:24:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:24:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:24:36,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080965323] [2024-10-12 19:24:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080965323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:24:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:24:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:24:36,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390613739] [2024-10-12 19:24:36,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:24:36,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:24:36,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:24:36,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:24:36,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:24:36,015 INFO L87 Difference]: Start difference. First operand 49034 states and 80068 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-12 19:24:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:24:37,307 INFO L93 Difference]: Finished difference Result 49233 states and 80404 transitions. [2024-10-12 19:24:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:24:37,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 87 [2024-10-12 19:24:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:24:37,316 INFO L225 Difference]: With dead ends: 49233 [2024-10-12 19:24:37,316 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:24:37,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:24:37,362 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 333 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:24:37,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 464 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:24:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:24:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:24:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:24:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:24:37,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2024-10-12 19:24:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:24:37,366 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:24:37,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-12 19:24:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:24:37,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:24:37,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:24:37,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:24:37,372 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:24:37,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.