./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/product-lines/email_spec0_product09.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b43506942a12950209750f07d771d1d388e9661c8c19f0364d898e10e246352 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:34:45,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:34:45,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:34:45,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:34:45,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:34:45,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:34:45,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:34:45,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:34:45,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:34:45,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:34:45,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:34:45,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:34:45,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:34:45,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:34:45,380 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:34:45,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:34:45,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:34:45,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:34:45,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:34:45,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:34:45,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:34:45,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:34:45,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:34:45,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:34:45,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:34:45,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:34:45,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:34:45,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:34:45,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:34:45,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:34:45,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:34:45,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:34:45,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:34:45,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:34:45,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:34:45,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:34:45,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:34:45,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:34:45,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:34:45,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:34:45,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:34:45,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:34:45,390 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 -> 3b43506942a12950209750f07d771d1d388e9661c8c19f0364d898e10e246352 [2024-11-11 20:34:45,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:34:45,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:34:45,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:34:45,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:34:45,688 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:34:45,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product09.cil.c [2024-11-11 20:34:47,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:34:47,474 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:34:47,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product09.cil.c [2024-11-11 20:34:47,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd655c366/b21b585e4f6349dd9dc095e00643b59d/FLAGf33d6950c [2024-11-11 20:34:47,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd655c366/b21b585e4f6349dd9dc095e00643b59d [2024-11-11 20:34:47,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:34:47,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:34:47,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:34:47,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:34:47,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:34:47,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:34:47" (1/1) ... [2024-11-11 20:34:47,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408a7b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:47, skipping insertion in model container [2024-11-11 20:34:47,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:34:47" (1/1) ... [2024-11-11 20:34:47,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:34:48,024 WARN L250 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_spec0_product09.cil.c[57372,57385] [2024-11-11 20:34:48,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:34:48,047 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:34:48,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-11-11 20:34:48,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [246] [2024-11-11 20:34:48,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [295] [2024-11-11 20:34:48,057 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [448] [2024-11-11 20:34:48,057 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [860] [2024-11-11 20:34:48,057 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1226] [2024-11-11 20:34:48,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2301] [2024-11-11 20:34:48,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2503] [2024-11-11 20:34:48,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2567] [2024-11-11 20:34:48,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2584] [2024-11-11 20:34:48,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2593] [2024-11-11 20:34:48,154 WARN L250 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_spec0_product09.cil.c[57372,57385] [2024-11-11 20:34:48,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:34:48,231 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:34:48,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48 WrapperNode [2024-11-11 20:34:48,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:34:48,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:34:48,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:34:48,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:34:48,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,332 INFO L138 Inliner]: procedures = 110, calls = 128, calls flagged for inlining = 38, calls inlined = 33, statements flattened = 661 [2024-11-11 20:34:48,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:34:48,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:34:48,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:34:48,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:34:48,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,364 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-11-11 20:34:48,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:34:48,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:34:48,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:34:48,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:34:48,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (1/1) ... [2024-11-11 20:34:48,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:34:48,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:34:48,416 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-11-11 20:34:48,417 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-11-11 20:34:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Base [2024-11-11 20:34:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Base [2024-11-11 20:34:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-11-11 20:34:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-11-11 20:34:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-11-11 20:34:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-11-11 20:34:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:34:48,450 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:34:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:34:48,450 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:34:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:34:48,450 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:34:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:34:48,450 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:34:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:34:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-11-11 20:34:48,451 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-11-11 20:34:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:34:48,451 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:34:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:34:48,451 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:34:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:34:48,451 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:34:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:34:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:34:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-11-11 20:34:48,452 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-11-11 20:34:48,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:34:48,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:34:48,574 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:34:48,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:34:48,981 INFO L? ?]: Removed 279 outVars from TransFormulas that were not future-live. [2024-11-11 20:34:48,982 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:34:48,994 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:34:48,994 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:34:48,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:34:48 BoogieIcfgContainer [2024-11-11 20:34:48,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:34:48,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:34:48,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:34:48,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:34:48,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:34:47" (1/3) ... [2024-11-11 20:34:48,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241e4ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:34:48, skipping insertion in model container [2024-11-11 20:34:48,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:34:48" (2/3) ... [2024-11-11 20:34:49,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241e4ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:34:48, skipping insertion in model container [2024-11-11 20:34:49,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:34:48" (3/3) ... [2024-11-11 20:34:49,001 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product09.cil.c [2024-11-11 20:34:49,014 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:34:49,014 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:34:49,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:34:49,090 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;@66152e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:34:49,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:34:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 169 states have (on average 1.5621301775147929) internal successors, (264), 172 states have internal predecessors, (264), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 20:34:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-11 20:34:49,105 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:49,106 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:49,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:49,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1774813752, now seen corresponding path program 1 times [2024-11-11 20:34:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:49,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304917656] [2024-11-11 20:34:49,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:49,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:34:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:34:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:34:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:34:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:34:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:34:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:34:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:34:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 20:34:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:49,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304917656] [2024-11-11 20:34:49,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304917656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:34:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507181250] [2024-11-11 20:34:49,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:49,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:34:49,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:34:49,626 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-11-11 20:34:49,631 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-11-11 20:34:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:49,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:34:49,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:34:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 20:34:49,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:34:49,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507181250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:49,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:34:49,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-11 20:34:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699541766] [2024-11-11 20:34:49,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:49,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:34:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:49,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:34:49,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:34:49,947 INFO L87 Difference]: Start difference. First operand has 209 states, 169 states have (on average 1.5621301775147929) internal successors, (264), 172 states have internal predecessors, (264), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:49,983 INFO L93 Difference]: Finished difference Result 329 states and 487 transitions. [2024-11-11 20:34:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:34:49,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2024-11-11 20:34:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:49,998 INFO L225 Difference]: With dead ends: 329 [2024-11-11 20:34:49,998 INFO L226 Difference]: Without dead ends: 202 [2024-11-11 20:34:50,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:34:50,008 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:50,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:34:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-11 20:34:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-11 20:34:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 163 states have (on average 1.5521472392638036) internal successors, (253), 165 states have internal predecessors, (253), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-11 20:34:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2024-11-11 20:34:50,060 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 304 transitions. Word has length 84 [2024-11-11 20:34:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:50,062 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 304 transitions. [2024-11-11 20:34:50,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 304 transitions. [2024-11-11 20:34:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 20:34:50,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:50,066 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:50,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:34:50,267 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-11-11 20:34:50,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:50,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:50,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1993537687, now seen corresponding path program 1 times [2024-11-11 20:34:50,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:50,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772999815] [2024-11-11 20:34:50,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:50,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:34:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:34:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:34:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:34:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 20:34:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:34:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:34:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:34:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:34:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 20:34:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:50,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772999815] [2024-11-11 20:34:50,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772999815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:34:50,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977787888] [2024-11-11 20:34:50,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:50,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:34:50,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:34:50,503 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-11-11 20:34:50,504 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-11-11 20:34:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:50,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:34:50,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:34:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 20:34:50,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:34:50,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977787888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:50,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:34:50,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 20:34:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079071462] [2024-11-11 20:34:50,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:50,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:34:50,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:50,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:34:50,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:34:50,821 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:50,844 INFO L93 Difference]: Finished difference Result 319 states and 465 transitions. [2024-11-11 20:34:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:34:50,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2024-11-11 20:34:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:50,846 INFO L225 Difference]: With dead ends: 319 [2024-11-11 20:34:50,846 INFO L226 Difference]: Without dead ends: 205 [2024-11-11 20:34:50,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:34:50,848 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:50,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 602 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:34:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-11 20:34:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2024-11-11 20:34:50,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 167 states have internal predecessors, (255), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-11 20:34:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 306 transitions. [2024-11-11 20:34:50,874 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 306 transitions. Word has length 85 [2024-11-11 20:34:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:50,874 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 306 transitions. [2024-11-11 20:34:50,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 306 transitions. [2024-11-11 20:34:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 20:34:50,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:50,882 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:50,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:34:51,082 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-11-11 20:34:51,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:51,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:51,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1008731173, now seen corresponding path program 1 times [2024-11-11 20:34:51,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:51,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436318343] [2024-11-11 20:34:51,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:51,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:34:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:34:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:34:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:34:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:34:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:34:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:34:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:34:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:34:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 20:34:51,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:51,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436318343] [2024-11-11 20:34:51,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436318343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:34:51,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475687843] [2024-11-11 20:34:51,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:51,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:34:51,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:34:51,346 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-11-11 20:34:51,347 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-11-11 20:34:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:51,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:34:51,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:34:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:34:51,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:34:51,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475687843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:51,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:34:51,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-11 20:34:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389134496] [2024-11-11 20:34:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:51,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:34:51,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:51,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:34:51,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:34:51,647 INFO L87 Difference]: Start difference. First operand 204 states and 306 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:34:51,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:51,715 INFO L93 Difference]: Finished difference Result 401 states and 605 transitions. [2024-11-11 20:34:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:34:51,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 90 [2024-11-11 20:34:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:51,721 INFO L225 Difference]: With dead ends: 401 [2024-11-11 20:34:51,722 INFO L226 Difference]: Without dead ends: 206 [2024-11-11 20:34:51,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 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-11-11 20:34:51,728 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 2 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:51,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1173 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:34:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-11 20:34:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-11 20:34:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 166 states have (on average 1.5421686746987953) internal successors, (256), 169 states have internal predecessors, (256), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (27), 24 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-11 20:34:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 309 transitions. [2024-11-11 20:34:51,752 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 309 transitions. Word has length 90 [2024-11-11 20:34:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:51,753 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 309 transitions. [2024-11-11 20:34:51,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:34:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 309 transitions. [2024-11-11 20:34:51,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 20:34:51,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:51,754 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:51,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:34:51,955 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-11-11 20:34:51,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:51,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1416843367, now seen corresponding path program 1 times [2024-11-11 20:34:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136055767] [2024-11-11 20:34:51,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:51,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:34:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:34:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:34:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:34:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:34:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:34:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:34:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:34:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:34:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 20:34:52,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:52,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136055767] [2024-11-11 20:34:52,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136055767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:52,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:52,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:34:52,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710066137] [2024-11-11 20:34:52,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:52,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:34:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:52,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:34:52,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:34:52,155 INFO L87 Difference]: Start difference. First operand 206 states and 309 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:34:53,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:53,468 INFO L93 Difference]: Finished difference Result 517 states and 796 transitions. [2024-11-11 20:34:53,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:34:53,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2024-11-11 20:34:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:53,471 INFO L225 Difference]: With dead ends: 517 [2024-11-11 20:34:53,472 INFO L226 Difference]: Without dead ends: 330 [2024-11-11 20:34:53,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 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-11-11 20:34:53,473 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 476 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:53,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 726 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:34:53,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-11 20:34:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 206. [2024-11-11 20:34:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 166 states have (on average 1.5421686746987953) internal successors, (256), 169 states have internal predecessors, (256), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (26), 24 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-11 20:34:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 308 transitions. [2024-11-11 20:34:53,494 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 308 transitions. Word has length 91 [2024-11-11 20:34:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:53,495 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 308 transitions. [2024-11-11 20:34:53,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:34:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 308 transitions. [2024-11-11 20:34:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-11 20:34:53,498 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:53,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:53,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:34:53,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:53,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash -142239273, now seen corresponding path program 2 times [2024-11-11 20:34:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:53,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362435480] [2024-11-11 20:34:53,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:34:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:34:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:34:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:34:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:34:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:34:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:34:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:34:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 20:34:53,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:53,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362435480] [2024-11-11 20:34:53,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362435480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:53,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:53,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:34:53,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681488718] [2024-11-11 20:34:53,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:53,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:34:53,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:53,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:34:53,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:34:53,680 INFO L87 Difference]: Start difference. First operand 206 states and 308 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:34:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:55,297 INFO L93 Difference]: Finished difference Result 519 states and 799 transitions. [2024-11-11 20:34:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:34:55,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2024-11-11 20:34:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:55,300 INFO L225 Difference]: With dead ends: 519 [2024-11-11 20:34:55,300 INFO L226 Difference]: Without dead ends: 332 [2024-11-11 20:34:55,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:34:55,302 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 474 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:55,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 725 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:34:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-11 20:34:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 208. [2024-11-11 20:34:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 167 states have (on average 1.5389221556886228) internal successors, (257), 171 states have internal predecessors, (257), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-11 20:34:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 311 transitions. [2024-11-11 20:34:55,351 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 311 transitions. Word has length 92 [2024-11-11 20:34:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:55,352 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 311 transitions. [2024-11-11 20:34:55,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:34:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 311 transitions. [2024-11-11 20:34:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 20:34:55,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:55,353 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:55,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:34:55,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:55,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:55,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1191959156, now seen corresponding path program 1 times [2024-11-11 20:34:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:55,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974770355] [2024-11-11 20:34:55,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:34:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:34:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:34:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:34:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:34:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:34:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:34:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:34:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:34:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974770355] [2024-11-11 20:34:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974770355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:34:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926103775] [2024-11-11 20:34:55,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:55,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:34:55,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:34:55,554 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-11-11 20:34:55,555 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-11-11 20:34:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:55,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:34:55,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:34:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:34:55,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:34:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:34:55,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926103775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:34:55,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:34:55,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-11 20:34:55,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31600727] [2024-11-11 20:34:55,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:34:55,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:34:55,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:55,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:34:55,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:55,847 INFO L87 Difference]: Start difference. First operand 208 states and 311 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-11 20:34:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:56,949 INFO L93 Difference]: Finished difference Result 614 states and 974 transitions. [2024-11-11 20:34:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:34:56,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 93 [2024-11-11 20:34:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:56,952 INFO L225 Difference]: With dead ends: 614 [2024-11-11 20:34:56,952 INFO L226 Difference]: Without dead ends: 500 [2024-11-11 20:34:56,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 203 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-11-11 20:34:56,954 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 725 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:56,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 865 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:34:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-11 20:34:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 352. [2024-11-11 20:34:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 302 states have (on average 1.6655629139072847) internal successors, (503), 306 states have internal predecessors, (503), 35 states have call successors, (35), 12 states have call predecessors, (35), 14 states have return successors, (37), 33 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-11 20:34:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 575 transitions. [2024-11-11 20:34:56,982 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 575 transitions. Word has length 93 [2024-11-11 20:34:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:56,982 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 575 transitions. [2024-11-11 20:34:56,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-11 20:34:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 575 transitions. [2024-11-11 20:34:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 20:34:56,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:56,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:34:57,004 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-11-11 20:34:57,188 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-11-11 20:34:57,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:57,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:57,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1719121859, now seen corresponding path program 1 times [2024-11-11 20:34:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:57,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928438486] [2024-11-11 20:34:57,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:57,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:34:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:34:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:34:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:34:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:34:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:34:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:34:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:34:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:34:57,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:57,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928438486] [2024-11-11 20:34:57,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928438486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:57,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:57,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:57,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580775069] [2024-11-11 20:34:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:57,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:57,277 INFO L87 Difference]: Start difference. First operand 352 states and 575 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:57,973 INFO L93 Difference]: Finished difference Result 951 states and 1590 transitions. [2024-11-11 20:34:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:34:57,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2024-11-11 20:34:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:57,976 INFO L225 Difference]: With dead ends: 951 [2024-11-11 20:34:57,976 INFO L226 Difference]: Without dead ends: 627 [2024-11-11 20:34:57,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-11-11 20:34:57,978 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 557 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:57,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 515 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:34:57,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-11 20:34:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 495. [2024-11-11 20:34:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 436 states have (on average 1.701834862385321) internal successors, (742), 440 states have internal predecessors, (742), 44 states have call successors, (44), 12 states have call predecessors, (44), 14 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2024-11-11 20:34:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 832 transitions. [2024-11-11 20:34:57,997 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 832 transitions. Word has length 100 [2024-11-11 20:34:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:57,997 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 832 transitions. [2024-11-11 20:34:57,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 832 transitions. [2024-11-11 20:34:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 20:34:57,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:57,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:34:57,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:34:58,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:58,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash 800915596, now seen corresponding path program 1 times [2024-11-11 20:34:58,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:58,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378838710] [2024-11-11 20:34:58,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:58,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:34:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:34:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 20:34:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:34:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:34:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:34:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:34:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:34:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:34:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378838710] [2024-11-11 20:34:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378838710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:58,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:58,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377846059] [2024-11-11 20:34:58,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:58,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:58,079 INFO L87 Difference]: Start difference. First operand 495 states and 832 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:58,773 INFO L93 Difference]: Finished difference Result 1323 states and 2260 transitions. [2024-11-11 20:34:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:34:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2024-11-11 20:34:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:58,777 INFO L225 Difference]: With dead ends: 1323 [2024-11-11 20:34:58,777 INFO L226 Difference]: Without dead ends: 864 [2024-11-11 20:34:58,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:58,778 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 554 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:58,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 512 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:34:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-11 20:34:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 732. [2024-11-11 20:34:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 658 states have (on average 1.7234042553191489) internal successors, (1134), 662 states have internal predecessors, (1134), 59 states have call successors, (59), 12 states have call predecessors, (59), 14 states have return successors, (61), 57 states have call predecessors, (61), 58 states have call successors, (61) [2024-11-11 20:34:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1254 transitions. [2024-11-11 20:34:58,802 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1254 transitions. Word has length 101 [2024-11-11 20:34:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:58,803 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1254 transitions. [2024-11-11 20:34:58,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1254 transitions. [2024-11-11 20:34:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 20:34:58,805 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:58,805 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:34:58,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:34:58,806 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash 437570885, now seen corresponding path program 1 times [2024-11-11 20:34:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:58,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395861913] [2024-11-11 20:34:58,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:58,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:34:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:34:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:34:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:34:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:34:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:34:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:34:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:34:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:34:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:34:58,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395861913] [2024-11-11 20:34:58,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395861913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:58,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:58,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:58,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065921603] [2024-11-11 20:34:58,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:58,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:58,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:58,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:58,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:58,884 INFO L87 Difference]: Start difference. First operand 732 states and 1254 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:59,649 INFO L93 Difference]: Finished difference Result 1919 states and 3324 transitions. [2024-11-11 20:34:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:34:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2024-11-11 20:34:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:59,654 INFO L225 Difference]: With dead ends: 1919 [2024-11-11 20:34:59,654 INFO L226 Difference]: Without dead ends: 1242 [2024-11-11 20:34:59,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:59,656 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 551 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:59,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 512 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:34:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2024-11-11 20:34:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1110. [2024-11-11 20:34:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1012 states have (on average 1.7312252964426877) internal successors, (1752), 1016 states have internal predecessors, (1752), 83 states have call successors, (83), 12 states have call predecessors, (83), 14 states have return successors, (85), 81 states have call predecessors, (85), 82 states have call successors, (85) [2024-11-11 20:34:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1920 transitions. [2024-11-11 20:34:59,684 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1920 transitions. Word has length 102 [2024-11-11 20:34:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:59,684 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1920 transitions. [2024-11-11 20:34:59,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:34:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1920 transitions. [2024-11-11 20:34:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 20:34:59,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:59,687 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:34:59,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:34:59,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:59,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1191147766, now seen corresponding path program 1 times [2024-11-11 20:34:59,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:59,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181913145] [2024-11-11 20:34:59,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:34:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:34:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:34:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:34:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:34:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:34:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:34:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:34:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:34:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:34:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:59,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181913145] [2024-11-11 20:34:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181913145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:59,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:59,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:34:59,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903295960] [2024-11-11 20:34:59,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:59,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:34:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:59,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:34:59,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:34:59,761 INFO L87 Difference]: Start difference. First operand 1110 states and 1920 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:00,558 INFO L93 Difference]: Finished difference Result 2869 states and 5007 transitions. [2024-11-11 20:35:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:00,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 103 [2024-11-11 20:35:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:00,565 INFO L225 Difference]: With dead ends: 2869 [2024-11-11 20:35:00,565 INFO L226 Difference]: Without dead ends: 1852 [2024-11-11 20:35:00,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-11-11 20:35:00,567 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 550 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:00,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 536 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:35:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2024-11-11 20:35:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1720. [2024-11-11 20:35:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1583 states have (on average 1.7308907138344916) internal successors, (2740), 1587 states have internal predecessors, (2740), 122 states have call successors, (122), 12 states have call predecessors, (122), 14 states have return successors, (124), 120 states have call predecessors, (124), 121 states have call successors, (124) [2024-11-11 20:35:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2986 transitions. [2024-11-11 20:35:00,603 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2986 transitions. Word has length 103 [2024-11-11 20:35:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:00,603 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2986 transitions. [2024-11-11 20:35:00,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2986 transitions. [2024-11-11 20:35:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 20:35:00,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:00,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:00,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:35:00,607 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:00,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1632128313, now seen corresponding path program 1 times [2024-11-11 20:35:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:00,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401678503] [2024-11-11 20:35:00,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:35:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:35:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:35:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:35:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:35:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:35:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:35:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:35:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401678503] [2024-11-11 20:35:00,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401678503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:00,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:00,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:35:00,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379783119] [2024-11-11 20:35:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:00,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:35:00,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:00,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:35:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:35:00,668 INFO L87 Difference]: Start difference. First operand 1720 states and 2986 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:01,365 INFO L93 Difference]: Finished difference Result 4434 states and 7763 transitions. [2024-11-11 20:35:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:01,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2024-11-11 20:35:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:01,379 INFO L225 Difference]: With dead ends: 4434 [2024-11-11 20:35:01,379 INFO L226 Difference]: Without dead ends: 2872 [2024-11-11 20:35:01,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:35:01,383 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 548 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:01,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 538 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:35:01,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2024-11-11 20:35:01,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2740. [2024-11-11 20:35:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2740 states, 2537 states have (on average 1.7268427276310603) internal successors, (4381), 2541 states have internal predecessors, (4381), 188 states have call successors, (188), 12 states have call predecessors, (188), 14 states have return successors, (190), 186 states have call predecessors, (190), 187 states have call successors, (190) [2024-11-11 20:35:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 4759 transitions. [2024-11-11 20:35:01,470 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 4759 transitions. Word has length 104 [2024-11-11 20:35:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:01,470 INFO L471 AbstractCegarLoop]: Abstraction has 2740 states and 4759 transitions. [2024-11-11 20:35:01,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 4759 transitions. [2024-11-11 20:35:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 20:35:01,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:01,478 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:01,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:35:01,478 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:01,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1275080072, now seen corresponding path program 1 times [2024-11-11 20:35:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888583553] [2024-11-11 20:35:01,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:01,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:35:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:35:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:35:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:35:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:35:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:35:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:35:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:35:01,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:01,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888583553] [2024-11-11 20:35:01,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888583553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:01,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:01,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:35:01,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747408287] [2024-11-11 20:35:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:01,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:35:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:35:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:35:01,546 INFO L87 Difference]: Start difference. First operand 2740 states and 4759 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:02,256 INFO L93 Difference]: Finished difference Result 6859 states and 12055 transitions. [2024-11-11 20:35:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 105 [2024-11-11 20:35:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:02,272 INFO L225 Difference]: With dead ends: 6859 [2024-11-11 20:35:02,272 INFO L226 Difference]: Without dead ends: 4457 [2024-11-11 20:35:02,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:35:02,277 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 548 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:02,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 526 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:35:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2024-11-11 20:35:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 4325. [2024-11-11 20:35:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4325 states, 4005 states have (on average 1.7273408239700374) internal successors, (6918), 4009 states have internal predecessors, (6918), 305 states have call successors, (305), 12 states have call predecessors, (305), 14 states have return successors, (307), 303 states have call predecessors, (307), 304 states have call successors, (307) [2024-11-11 20:35:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 7530 transitions. [2024-11-11 20:35:02,401 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 7530 transitions. Word has length 105 [2024-11-11 20:35:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:02,401 INFO L471 AbstractCegarLoop]: Abstraction has 4325 states and 7530 transitions. [2024-11-11 20:35:02,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 7530 transitions. [2024-11-11 20:35:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-11 20:35:02,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:02,411 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:02,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:35:02,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:02,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1046251593, now seen corresponding path program 1 times [2024-11-11 20:35:02,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:02,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518428980] [2024-11-11 20:35:02,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:02,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:35:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:35:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:35:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:35:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:35:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:35:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:35:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:35:02,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:02,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518428980] [2024-11-11 20:35:02,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518428980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:02,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:02,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:35:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278164917] [2024-11-11 20:35:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:02,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:35:02,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:35:02,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:35:02,483 INFO L87 Difference]: Start difference. First operand 4325 states and 7530 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:03,392 INFO L93 Difference]: Finished difference Result 11366 states and 19970 transitions. [2024-11-11 20:35:03,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:03,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2024-11-11 20:35:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:03,420 INFO L225 Difference]: With dead ends: 11366 [2024-11-11 20:35:03,421 INFO L226 Difference]: Without dead ends: 7522 [2024-11-11 20:35:03,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-11-11 20:35:03,429 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 546 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:03,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 510 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:35:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2024-11-11 20:35:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7390. [2024-11-11 20:35:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7390 states, 6854 states have (on average 1.7213306098628538) internal successors, (11798), 6858 states have internal predecessors, (11798), 521 states have call successors, (521), 12 states have call predecessors, (521), 14 states have return successors, (523), 519 states have call predecessors, (523), 520 states have call successors, (523) [2024-11-11 20:35:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 12842 transitions. [2024-11-11 20:35:03,610 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 12842 transitions. Word has length 106 [2024-11-11 20:35:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:03,611 INFO L471 AbstractCegarLoop]: Abstraction has 7390 states and 12842 transitions. [2024-11-11 20:35:03,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 12842 transitions. [2024-11-11 20:35:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 20:35:03,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:03,634 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:03,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:35:03,634 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:03,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1300941798, now seen corresponding path program 1 times [2024-11-11 20:35:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107992555] [2024-11-11 20:35:03,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:35:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:35:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:35:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:35:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:35:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:35:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:35:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:35:03,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:03,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107992555] [2024-11-11 20:35:03,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107992555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:03,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:03,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:35:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369852188] [2024-11-11 20:35:03,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:03,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:35:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:03,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:35:03,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:35:03,723 INFO L87 Difference]: Start difference. First operand 7390 states and 12842 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:04,550 INFO L93 Difference]: Finished difference Result 16936 states and 29417 transitions. [2024-11-11 20:35:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:04,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2024-11-11 20:35:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:04,590 INFO L225 Difference]: With dead ends: 16936 [2024-11-11 20:35:04,590 INFO L226 Difference]: Without dead ends: 10773 [2024-11-11 20:35:04,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-11-11 20:35:04,604 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 541 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:04,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 485 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:35:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10773 states. [2024-11-11 20:35:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10773 to 10641. [2024-11-11 20:35:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10641 states, 10105 states have (on average 1.6966848095002474) internal successors, (17145), 10109 states have internal predecessors, (17145), 521 states have call successors, (521), 12 states have call predecessors, (521), 14 states have return successors, (523), 519 states have call predecessors, (523), 520 states have call successors, (523) [2024-11-11 20:35:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10641 states to 10641 states and 18189 transitions. [2024-11-11 20:35:04,846 INFO L78 Accepts]: Start accepts. Automaton has 10641 states and 18189 transitions. Word has length 107 [2024-11-11 20:35:04,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:04,846 INFO L471 AbstractCegarLoop]: Abstraction has 10641 states and 18189 transitions. [2024-11-11 20:35:04,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 10641 states and 18189 transitions. [2024-11-11 20:35:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 20:35:04,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:04,865 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:04,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:35:04,866 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:04,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash 752921054, now seen corresponding path program 2 times [2024-11-11 20:35:04,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253146312] [2024-11-11 20:35:04,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:04,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:35:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:35:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:35:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:35:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:35:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:35:04,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253146312] [2024-11-11 20:35:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253146312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:04,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:04,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:35:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327741416] [2024-11-11 20:35:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:04,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:35:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:04,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:35:04,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:35:04,969 INFO L87 Difference]: Start difference. First operand 10641 states and 18189 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:05,995 INFO L93 Difference]: Finished difference Result 19747 states and 33880 transitions. [2024-11-11 20:35:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:35:05,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 108 [2024-11-11 20:35:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:06,018 INFO L225 Difference]: With dead ends: 19747 [2024-11-11 20:35:06,019 INFO L226 Difference]: Without dead ends: 10773 [2024-11-11 20:35:06,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:35:06,032 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 555 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:06,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1202 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:35:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10773 states. [2024-11-11 20:35:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10773 to 10641. [2024-11-11 20:35:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10641 states, 10105 states have (on average 1.683127164769916) internal successors, (17008), 10109 states have internal predecessors, (17008), 521 states have call successors, (521), 12 states have call predecessors, (521), 14 states have return successors, (523), 519 states have call predecessors, (523), 520 states have call successors, (523) [2024-11-11 20:35:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10641 states to 10641 states and 18052 transitions. [2024-11-11 20:35:06,366 INFO L78 Accepts]: Start accepts. Automaton has 10641 states and 18052 transitions. Word has length 108 [2024-11-11 20:35:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:06,367 INFO L471 AbstractCegarLoop]: Abstraction has 10641 states and 18052 transitions. [2024-11-11 20:35:06,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:06,368 INFO L276 IsEmpty]: Start isEmpty. Operand 10641 states and 18052 transitions. [2024-11-11 20:35:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 20:35:06,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:06,387 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:06,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:35:06,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:06,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1599377333, now seen corresponding path program 1 times [2024-11-11 20:35:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:06,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372945657] [2024-11-11 20:35:06,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:35:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:35:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:35:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:35:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:35:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:35:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:35:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:35:06,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:06,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372945657] [2024-11-11 20:35:06,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372945657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:06,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:06,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:35:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31991111] [2024-11-11 20:35:06,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:06,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:35:06,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:06,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:35:06,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:35:06,472 INFO L87 Difference]: Start difference. First operand 10641 states and 18052 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:07,598 INFO L93 Difference]: Finished difference Result 28476 states and 48542 transitions. [2024-11-11 20:35:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 108 [2024-11-11 20:35:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:07,659 INFO L225 Difference]: With dead ends: 28476 [2024-11-11 20:35:07,659 INFO L226 Difference]: Without dead ends: 19350 [2024-11-11 20:35:07,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-11-11 20:35:07,681 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 539 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:07,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 512 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:35:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19350 states. [2024-11-11 20:35:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19350 to 19218. [2024-11-11 20:35:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19218 states, 18271 states have (on average 1.6699140714793936) internal successors, (30511), 18275 states have internal predecessors, (30511), 932 states have call successors, (932), 12 states have call predecessors, (932), 14 states have return successors, (934), 930 states have call predecessors, (934), 931 states have call successors, (934) [2024-11-11 20:35:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19218 states to 19218 states and 32377 transitions. [2024-11-11 20:35:08,118 INFO L78 Accepts]: Start accepts. Automaton has 19218 states and 32377 transitions. Word has length 108 [2024-11-11 20:35:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:08,118 INFO L471 AbstractCegarLoop]: Abstraction has 19218 states and 32377 transitions. [2024-11-11 20:35:08,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 19218 states and 32377 transitions. [2024-11-11 20:35:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:35:08,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:08,140 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:08,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:35:08,141 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:08,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1953118816, now seen corresponding path program 1 times [2024-11-11 20:35:08,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:08,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569966690] [2024-11-11 20:35:08,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:08,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:35:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:35:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:35:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:35:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:35:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:35:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:35:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:35:08,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:08,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569966690] [2024-11-11 20:35:08,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569966690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:08,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:08,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:35:08,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603632540] [2024-11-11 20:35:08,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:08,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:35:08,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:08,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:35:08,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:35:08,206 INFO L87 Difference]: Start difference. First operand 19218 states and 32377 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:09,523 INFO L93 Difference]: Finished difference Result 52998 states and 89549 transitions. [2024-11-11 20:35:09,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:09,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 109 [2024-11-11 20:35:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:09,608 INFO L225 Difference]: With dead ends: 52998 [2024-11-11 20:35:09,608 INFO L226 Difference]: Without dead ends: 35799 [2024-11-11 20:35:09,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:35:09,628 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 537 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:09,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 512 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:35:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35799 states. [2024-11-11 20:35:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35799 to 35667. [2024-11-11 20:35:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35667 states, 33922 states have (on average 1.6542067095100526) internal successors, (56114), 33926 states have internal predecessors, (56114), 1730 states have call successors, (1730), 12 states have call predecessors, (1730), 14 states have return successors, (1732), 1728 states have call predecessors, (1732), 1729 states have call successors, (1732) [2024-11-11 20:35:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35667 states to 35667 states and 59576 transitions. [2024-11-11 20:35:10,771 INFO L78 Accepts]: Start accepts. Automaton has 35667 states and 59576 transitions. Word has length 109 [2024-11-11 20:35:10,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:10,771 INFO L471 AbstractCegarLoop]: Abstraction has 35667 states and 59576 transitions. [2024-11-11 20:35:10,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 35667 states and 59576 transitions. [2024-11-11 20:35:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:35:10,913 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:10,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:10,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:35:10,913 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:10,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1046204083, now seen corresponding path program 1 times [2024-11-11 20:35:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114273614] [2024-11-11 20:35:10,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:35:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:35:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:35:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:35:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:35:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:35:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:35:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:35:11,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:11,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114273614] [2024-11-11 20:35:11,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114273614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:11,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:11,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:35:11,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797894172] [2024-11-11 20:35:11,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:11,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:35:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:11,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:35:11,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:35:11,063 INFO L87 Difference]: Start difference. First operand 35667 states and 59576 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:13,254 INFO L93 Difference]: Finished difference Result 67756 states and 113107 transitions. [2024-11-11 20:35:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:35:13,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2024-11-11 20:35:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:13,384 INFO L225 Difference]: With dead ends: 67756 [2024-11-11 20:35:13,384 INFO L226 Difference]: Without dead ends: 67642 [2024-11-11 20:35:13,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-11-11 20:35:13,396 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 534 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:13,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 512 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:35:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67642 states. [2024-11-11 20:35:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67642 to 67510. [2024-11-11 20:35:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67510 states, 64196 states have (on average 1.6362857498909589) internal successors, (105043), 64200 states have internal predecessors, (105043), 3299 states have call successors, (3299), 12 states have call predecessors, (3299), 14 states have return successors, (3301), 3297 states have call predecessors, (3301), 3298 states have call successors, (3301) [2024-11-11 20:35:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67510 states to 67510 states and 111643 transitions. [2024-11-11 20:35:15,283 INFO L78 Accepts]: Start accepts. Automaton has 67510 states and 111643 transitions. Word has length 110 [2024-11-11 20:35:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:15,283 INFO L471 AbstractCegarLoop]: Abstraction has 67510 states and 111643 transitions. [2024-11-11 20:35:15,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 67510 states and 111643 transitions. [2024-11-11 20:35:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:35:15,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:15,317 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:35:15,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:35:15,317 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:15,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1765900778, now seen corresponding path program 1 times [2024-11-11 20:35:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:15,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351188486] [2024-11-11 20:35:15,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:35:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:35:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:35:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:35:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:35:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:35:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:35:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:35:15,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:15,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351188486] [2024-11-11 20:35:15,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351188486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:15,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:15,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:35:15,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642296604] [2024-11-11 20:35:15,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:15,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:35:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:15,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:35:15,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:35:15,419 INFO L87 Difference]: Start difference. First operand 67510 states and 111643 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:17,670 INFO L93 Difference]: Finished difference Result 131923 states and 218520 transitions. [2024-11-11 20:35:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:35:17,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 111 [2024-11-11 20:35:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:17,825 INFO L225 Difference]: With dead ends: 131923 [2024-11-11 20:35:17,825 INFO L226 Difference]: Without dead ends: 67608 [2024-11-11 20:35:17,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:35:17,877 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 553 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:17,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1202 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:35:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67608 states. [2024-11-11 20:35:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67608 to 67476. [2024-11-11 20:35:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67476 states, 64162 states have (on average 1.620336024438141) internal successors, (103964), 64166 states have internal predecessors, (103964), 3299 states have call successors, (3299), 12 states have call predecessors, (3299), 14 states have return successors, (3301), 3297 states have call predecessors, (3301), 3298 states have call successors, (3301) [2024-11-11 20:35:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67476 states to 67476 states and 110564 transitions. [2024-11-11 20:35:19,533 INFO L78 Accepts]: Start accepts. Automaton has 67476 states and 110564 transitions. Word has length 111 [2024-11-11 20:35:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:19,533 INFO L471 AbstractCegarLoop]: Abstraction has 67476 states and 110564 transitions. [2024-11-11 20:35:19,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 67476 states and 110564 transitions. [2024-11-11 20:35:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:35:19,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:19,572 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:19,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:35:19,572 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:19,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:19,573 INFO L85 PathProgramCache]: Analyzing trace with hash -414235298, now seen corresponding path program 1 times [2024-11-11 20:35:19,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:19,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654462] [2024-11-11 20:35:19,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:35:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:35:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:35:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:35:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:35:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:35:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:35:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:35:20,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:20,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654462] [2024-11-11 20:35:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:35:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24322062] [2024-11-11 20:35:20,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:20,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:20,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:35:20,409 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-11-11 20:35:20,410 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-11-11 20:35:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:20,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-11 20:35:20,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:35:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:35:20,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:35:20,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24322062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:20,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:35:20,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18] total 28 [2024-11-11 20:35:20,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395186108] [2024-11-11 20:35:20,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:20,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:35:20,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:20,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:35:20,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2024-11-11 20:35:20,974 INFO L87 Difference]: Start difference. First operand 67476 states and 110564 transitions. Second operand has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-11 20:35:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:22,201 INFO L93 Difference]: Finished difference Result 67721 states and 110918 transitions. [2024-11-11 20:35:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 20:35:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 111 [2024-11-11 20:35:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:22,531 INFO L225 Difference]: With dead ends: 67721 [2024-11-11 20:35:22,532 INFO L226 Difference]: Without dead ends: 67613 [2024-11-11 20:35:22,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2024-11-11 20:35:22,551 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 481 mSDsluCounter, 2919 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:22,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 3258 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:35:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67613 states. [2024-11-11 20:35:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67613 to 67595. [2024-11-11 20:35:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67595 states, 64253 states have (on average 1.6200177423622244) internal successors, (104091), 64258 states have internal predecessors, (104091), 3316 states have call successors, (3316), 21 states have call predecessors, (3316), 25 states have return successors, (3330), 3315 states have call predecessors, (3330), 3314 states have call successors, (3330) [2024-11-11 20:35:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67595 states to 67595 states and 110737 transitions. [2024-11-11 20:35:24,247 INFO L78 Accepts]: Start accepts. Automaton has 67595 states and 110737 transitions. Word has length 111 [2024-11-11 20:35:24,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:24,248 INFO L471 AbstractCegarLoop]: Abstraction has 67595 states and 110737 transitions. [2024-11-11 20:35:24,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-11 20:35:24,248 INFO L276 IsEmpty]: Start isEmpty. Operand 67595 states and 110737 transitions. [2024-11-11 20:35:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:35:24,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:24,283 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:24,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:35:24,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:24,485 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:24,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash 530491642, now seen corresponding path program 1 times [2024-11-11 20:35:24,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:24,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279879434] [2024-11-11 20:35:24,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:35:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:35:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:35:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:35:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:35:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:35:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:35:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279879434] [2024-11-11 20:35:24,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279879434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:35:24,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909717081] [2024-11-11 20:35:24,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:24,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:24,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:35:24,592 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:35:24,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:35:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:24,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:35:24,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:35:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 20:35:24,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:35:24,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909717081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:24,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:35:24,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-11 20:35:24,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475681807] [2024-11-11 20:35:24,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:24,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:35:24,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:24,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:35:24,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:35:24,825 INFO L87 Difference]: Start difference. First operand 67595 states and 110737 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:35:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:25,765 INFO L93 Difference]: Finished difference Result 67710 states and 110900 transitions. [2024-11-11 20:35:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:35:25,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 112 [2024-11-11 20:35:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:25,873 INFO L225 Difference]: With dead ends: 67710 [2024-11-11 20:35:25,874 INFO L226 Difference]: Without dead ends: 67599 [2024-11-11 20:35:25,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:35:25,884 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:25,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1181 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:35:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67599 states. [2024-11-11 20:35:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67599 to 67597. [2024-11-11 20:35:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67597 states, 64254 states have (on average 1.620008092881377) internal successors, (104092), 64260 states have internal predecessors, (104092), 3316 states have call successors, (3316), 21 states have call predecessors, (3316), 26 states have return successors, (3333), 3315 states have call predecessors, (3333), 3314 states have call successors, (3333) [2024-11-11 20:35:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67597 states to 67597 states and 110741 transitions. [2024-11-11 20:35:27,852 INFO L78 Accepts]: Start accepts. Automaton has 67597 states and 110741 transitions. Word has length 112 [2024-11-11 20:35:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:27,852 INFO L471 AbstractCegarLoop]: Abstraction has 67597 states and 110741 transitions. [2024-11-11 20:35:27,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:35:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 67597 states and 110741 transitions. [2024-11-11 20:35:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:35:27,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:27,887 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:27,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 20:35:28,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:28,088 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:28,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:28,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1825313608, now seen corresponding path program 1 times [2024-11-11 20:35:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:28,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299791167] [2024-11-11 20:35:28,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:35:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:35:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:35:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:35:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:35:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:35:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:35:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:28,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:28,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299791167] [2024-11-11 20:35:28,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299791167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:35:28,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94628906] [2024-11-11 20:35:28,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:28,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:35:28,199 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:35:28,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 20:35:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:28,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 20:35:28,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:35:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-11 20:35:28,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:35:28,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94628906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:28,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:35:28,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2024-11-11 20:35:28,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290507958] [2024-11-11 20:35:28,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:28,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:35:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:35:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:35:28,545 INFO L87 Difference]: Start difference. First operand 67597 states and 110741 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:30,063 INFO L93 Difference]: Finished difference Result 67860 states and 111126 transitions. [2024-11-11 20:35:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:35:30,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2024-11-11 20:35:30,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:30,230 INFO L225 Difference]: With dead ends: 67860 [2024-11-11 20:35:30,230 INFO L226 Difference]: Without dead ends: 67748 [2024-11-11 20:35:30,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:35:30,259 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 371 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:30,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1469 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:35:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67748 states. [2024-11-11 20:35:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67748 to 67736. [2024-11-11 20:35:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67736 states, 64359 states have (on average 1.6196025419910192) internal successors, (104236), 64366 states have internal predecessors, (104236), 3339 states have call successors, (3339), 29 states have call predecessors, (3339), 37 states have return successors, (3368), 3340 states have call predecessors, (3368), 3334 states have call successors, (3368) [2024-11-11 20:35:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67736 states to 67736 states and 110943 transitions. [2024-11-11 20:35:32,047 INFO L78 Accepts]: Start accepts. Automaton has 67736 states and 110943 transitions. Word has length 112 [2024-11-11 20:35:32,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:32,047 INFO L471 AbstractCegarLoop]: Abstraction has 67736 states and 110943 transitions. [2024-11-11 20:35:32,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 67736 states and 110943 transitions. [2024-11-11 20:35:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:35:32,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:32,084 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:32,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 20:35:32,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:32,286 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:32,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash 265412263, now seen corresponding path program 1 times [2024-11-11 20:35:32,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:32,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018208845] [2024-11-11 20:35:32,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:35:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:35:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:35:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:35:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:35:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:35:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:35:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:32,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:32,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018208845] [2024-11-11 20:35:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018208845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:35:32,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307795716] [2024-11-11 20:35:32,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:32,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:32,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:35:32,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:35:32,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 20:35:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:32,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-11 20:35:32,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:35:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-11 20:35:33,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:35:33,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307795716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:33,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:35:33,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2024-11-11 20:35:33,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730094749] [2024-11-11 20:35:33,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:33,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:35:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:33,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:35:33,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:35:33,019 INFO L87 Difference]: Start difference. First operand 67736 states and 110943 transitions. Second operand has 12 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 7 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-11 20:35:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:33,964 INFO L93 Difference]: Finished difference Result 68295 states and 111796 transitions. [2024-11-11 20:35:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:35:33,964 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 7 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 113 [2024-11-11 20:35:33,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:34,086 INFO L225 Difference]: With dead ends: 68295 [2024-11-11 20:35:34,086 INFO L226 Difference]: Without dead ends: 67930 [2024-11-11 20:35:34,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:35:34,106 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 66 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:34,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3178 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:35:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67930 states. [2024-11-11 20:35:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67930 to 67923. [2024-11-11 20:35:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67923 states, 64500 states have (on average 1.6189147286821706) internal successors, (104420), 64510 states have internal predecessors, (104420), 3378 states have call successors, (3378), 34 states have call predecessors, (3378), 44 states have return successors, (3435), 3378 states have call predecessors, (3435), 3369 states have call successors, (3435) [2024-11-11 20:35:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67923 states to 67923 states and 111233 transitions. [2024-11-11 20:35:35,742 INFO L78 Accepts]: Start accepts. Automaton has 67923 states and 111233 transitions. Word has length 113 [2024-11-11 20:35:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:35,743 INFO L471 AbstractCegarLoop]: Abstraction has 67923 states and 111233 transitions. [2024-11-11 20:35:35,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 7 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-11 20:35:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 67923 states and 111233 transitions. [2024-11-11 20:35:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:35:35,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:35,782 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:35,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 20:35:35,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-11 20:35:35,985 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:35,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1154622035, now seen corresponding path program 1 times [2024-11-11 20:35:35,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:35,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304787877] [2024-11-11 20:35:35,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:35,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:35:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:35:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:35:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:35:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:35:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:35:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:35:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:35:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:36,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304787877] [2024-11-11 20:35:36,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304787877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:36,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:35:36,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:35:36,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921477824] [2024-11-11 20:35:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:36,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:35:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:35:36,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:35:36,128 INFO L87 Difference]: Start difference. First operand 67923 states and 111233 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:39,367 INFO L93 Difference]: Finished difference Result 134713 states and 220927 transitions. [2024-11-11 20:35:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 20:35:39,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2024-11-11 20:35:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:39,649 INFO L225 Difference]: With dead ends: 134713 [2024-11-11 20:35:39,649 INFO L226 Difference]: Without dead ends: 134192 [2024-11-11 20:35:39,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2024-11-11 20:35:39,686 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1154 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:39,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 720 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:35:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134192 states. [2024-11-11 20:35:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134192 to 132878. [2024-11-11 20:35:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132878 states, 126177 states have (on average 1.6208738518113444) internal successors, (204517), 126196 states have internal predecessors, (204517), 6615 states have call successors, (6615), 66 states have call predecessors, (6615), 85 states have return successors, (6728), 6615 states have call predecessors, (6728), 6597 states have call successors, (6728) [2024-11-11 20:35:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132878 states to 132878 states and 217860 transitions. [2024-11-11 20:35:43,443 INFO L78 Accepts]: Start accepts. Automaton has 132878 states and 217860 transitions. Word has length 112 [2024-11-11 20:35:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:35:43,443 INFO L471 AbstractCegarLoop]: Abstraction has 132878 states and 217860 transitions. [2024-11-11 20:35:43,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 132878 states and 217860 transitions. [2024-11-11 20:35:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:35:43,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:35:43,503 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 20:35:43,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 20:35:43,503 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:35:43,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:35:43,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1772644026, now seen corresponding path program 1 times [2024-11-11 20:35:43,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:35:43,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601902258] [2024-11-11 20:35:43,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:43,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:35:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:35:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:35:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:35:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:35:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:35:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:35:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:35:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:35:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:35:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:35:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:35:43,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:35:43,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601902258] [2024-11-11 20:35:43,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601902258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:35:43,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915024363] [2024-11-11 20:35:43,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:35:43,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:35:43,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:35:43,594 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:35:43,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 20:35:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:35:43,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 20:35:43,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:35:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-11 20:35:43,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:35:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915024363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:35:43,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:35:43,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-11 20:35:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652307342] [2024-11-11 20:35:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:35:43,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:35:43,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:35:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:35:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:35:43,858 INFO L87 Difference]: Start difference. First operand 132878 states and 217860 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:35:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:35:46,576 INFO L93 Difference]: Finished difference Result 133992 states and 219499 transitions. [2024-11-11 20:35:46,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:35:46,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2024-11-11 20:35:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:35:46,836 INFO L225 Difference]: With dead ends: 133992 [2024-11-11 20:35:46,836 INFO L226 Difference]: Without dead ends: 132928 [2024-11-11 20:35:46,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:35:46,871 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 8 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:35:46,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1535 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:35:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132928 states.