./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 18:24:03,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:24:03,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:24:03,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:24:03,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:24:03,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:24:03,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:24:03,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:24:03,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:24:03,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:24:03,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:24:03,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:24:03,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:24:03,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:24:03,298 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:24:03,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:24:03,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:24:03,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:24:03,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:24:03,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:24:03,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:24:03,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:24:03,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:24:03,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:24:03,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:24:03,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:24:03,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:24:03,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:24:03,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:24:03,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:24:03,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:24:03,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:24:03,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:24:03,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:24:03,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:24:03,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:24:03,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:24:03,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:24:03,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:24:03,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:24:03,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:24:03,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:24:03,319 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 18:24:03,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:24:03,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:24:03,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:24:03,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:24:03,695 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:24:03,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max.c [2024-09-12 18:24:05,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:24:05,296 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:24:05,297 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c [2024-09-12 18:24:05,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d2d1e4c3c/d6f689ef98364cdfbfe1d3aaf1ab0b2f/FLAGfe0d33c03 [2024-09-12 18:24:05,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d2d1e4c3c/d6f689ef98364cdfbfe1d3aaf1ab0b2f [2024-09-12 18:24:05,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:24:05,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:24:05,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:24:05,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:24:05,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:24:05,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f39f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05, skipping insertion in model container [2024-09-12 18:24:05,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:24:05,468 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-12 18:24:05,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:24:05,501 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:24:05,511 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-12 18:24:05,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:24:05,535 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:24:05,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05 WrapperNode [2024-09-12 18:24:05,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:24:05,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:24:05,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:24:05,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:24:05,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,554 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:24:05,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:24:05,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:24:05,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:24:05,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:24:05,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,580 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-12 18:24:05,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:24:05,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:24:05,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:24:05,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:24:05,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (1/1) ... [2024-09-12 18:24:05,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:24:05,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:05,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 18:24:05,631 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 18:24:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:24:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 18:24:05,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 18:24:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:24:05,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:24:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:24:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 18:24:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:24:05,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:24:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-12 18:24:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:24:05,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:24:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 18:24:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 18:24:05,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-12 18:24:05,672 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-12 18:24:05,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 18:24:05,672 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 18:24:05,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 18:24:05,752 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:24:05,754 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:24:05,933 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-09-12 18:24:05,933 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:24:05,956 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:24:05,957 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 18:24:05,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:24:05 BoogieIcfgContainer [2024-09-12 18:24:05,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:24:05,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:24:05,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:24:05,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:24:05,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:24:05" (1/3) ... [2024-09-12 18:24:05,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb2a5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:24:05, skipping insertion in model container [2024-09-12 18:24:05,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:05" (2/3) ... [2024-09-12 18:24:05,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb2a5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:24:05, skipping insertion in model container [2024-09-12 18:24:05,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:24:05" (3/3) ... [2024-09-12 18:24:05,967 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-09-12 18:24:05,983 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:24:05,983 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-09-12 18:24:06,029 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:24:06,034 INFO L336 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=All, 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;@297d7a5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:24:06,035 INFO L337 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-09-12 18:24:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 38 states have internal predecessors, (45), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 18:24:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 18:24:06,053 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:06,054 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:06,054 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:06,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:06,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2124994698, now seen corresponding path program 1 times [2024-09-12 18:24:06,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:06,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962236473] [2024-09-12 18:24:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:06,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:06,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:06,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:06,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962236473] [2024-09-12 18:24:06,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962236473] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:06,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:06,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:24:06,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138631645] [2024-09-12 18:24:06,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:06,358 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:24:06,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:06,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:24:06,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:24:06,385 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 38 states have internal predecessors, (45), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:24:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:06,500 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2024-09-12 18:24:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:24:06,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-09-12 18:24:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:06,511 INFO L225 Difference]: With dead ends: 96 [2024-09-12 18:24:06,512 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 18:24:06,515 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:24:06,521 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:06,522 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 67 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 18:24:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-12 18:24:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-09-12 18:24:06,559 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 16 [2024-09-12 18:24:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:06,560 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-09-12 18:24:06,560 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:24:06,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-09-12 18:24:06,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 18:24:06,562 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:06,562 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:06,563 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:24:06,563 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:06,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:06,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1489914228, now seen corresponding path program 1 times [2024-09-12 18:24:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:06,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868928431] [2024-09-12 18:24:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:06,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:06,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:06,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868928431] [2024-09-12 18:24:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868928431] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:06,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:24:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260328457] [2024-09-12 18:24:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:06,788 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:24:06,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:24:06,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:24:06,789 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:24:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:06,938 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-09-12 18:24:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:24:06,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-09-12 18:24:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:06,939 INFO L225 Difference]: With dead ends: 47 [2024-09-12 18:24:06,939 INFO L226 Difference]: Without dead ends: 45 [2024-09-12 18:24:06,939 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:06,940 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:06,940 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 111 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-12 18:24:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-12 18:24:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 33 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-09-12 18:24:06,949 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2024-09-12 18:24:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:06,950 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-09-12 18:24:06,950 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:24:06,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-09-12 18:24:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 18:24:06,951 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:06,951 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:06,951 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 18:24:06,951 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:06,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1288613865, now seen corresponding path program 1 times [2024-09-12 18:24:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:06,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251463570] [2024-09-12 18:24:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:07,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:07,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251463570] [2024-09-12 18:24:07,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251463570] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:07,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:07,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:24:07,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563524304] [2024-09-12 18:24:07,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:07,021 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:24:07,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:07,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:24:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:24:07,022 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:07,132 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2024-09-12 18:24:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 18:24:07,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-09-12 18:24:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:07,134 INFO L225 Difference]: With dead ends: 71 [2024-09-12 18:24:07,134 INFO L226 Difference]: Without dead ends: 70 [2024-09-12 18:24:07,134 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:24:07,135 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:07,136 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 146 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-12 18:24:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2024-09-12 18:24:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2024-09-12 18:24:07,145 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 20 [2024-09-12 18:24:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:07,145 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2024-09-12 18:24:07,146 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:07,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2024-09-12 18:24:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 18:24:07,147 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:07,147 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:07,147 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:24:07,147 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:07,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1288614057, now seen corresponding path program 1 times [2024-09-12 18:24:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:07,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973285672] [2024-09-12 18:24:07,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:07,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:07,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973285672] [2024-09-12 18:24:07,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973285672] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:07,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:07,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:24:07,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079983951] [2024-09-12 18:24:07,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:07,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:24:07,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:24:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:07,221 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:07,307 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2024-09-12 18:24:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:24:07,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-09-12 18:24:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:07,309 INFO L225 Difference]: With dead ends: 71 [2024-09-12 18:24:07,309 INFO L226 Difference]: Without dead ends: 69 [2024-09-12 18:24:07,309 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:07,310 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 26 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:07,311 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-12 18:24:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2024-09-12 18:24:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 44 states have internal predecessors, (54), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2024-09-12 18:24:07,320 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 20 [2024-09-12 18:24:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:07,320 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2024-09-12 18:24:07,320 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:07,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2024-09-12 18:24:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 18:24:07,321 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:07,321 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:07,321 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 18:24:07,321 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:07,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1292324083, now seen corresponding path program 1 times [2024-09-12 18:24:07,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:07,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603720974] [2024-09-12 18:24:07,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:07,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:07,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603720974] [2024-09-12 18:24:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603720974] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:07,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:07,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:24:07,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182329073] [2024-09-12 18:24:07,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:07,378 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:24:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:24:07,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:24:07,379 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:24:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:07,460 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-09-12 18:24:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:24:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-12 18:24:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:07,461 INFO L225 Difference]: With dead ends: 56 [2024-09-12 18:24:07,461 INFO L226 Difference]: Without dead ends: 55 [2024-09-12 18:24:07,461 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:07,462 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:07,463 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 84 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-12 18:24:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-12 18:24:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.368421052631579) internal successors, (52), 43 states have internal predecessors, (52), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-09-12 18:24:07,470 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 21 [2024-09-12 18:24:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:07,470 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-09-12 18:24:07,470 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:24:07,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-09-12 18:24:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 18:24:07,471 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:07,472 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:07,472 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 18:24:07,472 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:07,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:07,472 INFO L85 PathProgramCache]: Analyzing trace with hash 282644626, now seen corresponding path program 1 times [2024-09-12 18:24:07,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:07,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835696066] [2024-09-12 18:24:07,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:07,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835696066] [2024-09-12 18:24:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835696066] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:07,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887084972] [2024-09-12 18:24:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:07,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:07,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:07,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:24:07,549 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 18:24:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:07,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:24:07,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:07,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:07,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887084972] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:07,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:24:07,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-09-12 18:24:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759561064] [2024-09-12 18:24:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:07,692 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:24:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:07,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:24:07,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:07,693 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:07,777 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2024-09-12 18:24:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:24:07,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-12 18:24:07,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:07,778 INFO L225 Difference]: With dead ends: 67 [2024-09-12 18:24:07,779 INFO L226 Difference]: Without dead ends: 66 [2024-09-12 18:24:07,779 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:07,780 INFO L434 NwaCegarLoop]: 46 mSDtfsCounter, 34 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:07,783 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 126 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-12 18:24:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2024-09-12 18:24:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-09-12 18:24:07,798 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 24 [2024-09-12 18:24:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:07,799 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-09-12 18:24:07,799 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:07,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-09-12 18:24:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 18:24:07,804 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:07,804 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:07,828 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:08,004 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 18:24:08,005 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:08,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 172048876, now seen corresponding path program 1 times [2024-09-12 18:24:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:08,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412322895] [2024-09-12 18:24:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:08,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:08,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:08,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:08,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:08,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:08,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412322895] [2024-09-12 18:24:08,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412322895] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:08,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018937538] [2024-09-12 18:24:08,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:08,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:08,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:08,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:24:08,085 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 18:24:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:08,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:24:08,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:08,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:08,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018937538] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:08,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:08,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-09-12 18:24:08,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861067355] [2024-09-12 18:24:08,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:08,362 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 18:24:08,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:08,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 18:24:08,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:24:08,362 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:08,494 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2024-09-12 18:24:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 18:24:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-12 18:24:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:08,496 INFO L225 Difference]: With dead ends: 139 [2024-09-12 18:24:08,496 INFO L226 Difference]: Without dead ends: 138 [2024-09-12 18:24:08,496 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:24:08,496 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 97 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:08,497 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 229 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-12 18:24:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 87. [2024-09-12 18:24:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.380281690140845) internal successors, (98), 75 states have internal predecessors, (98), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2024-09-12 18:24:08,509 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 25 [2024-09-12 18:24:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:08,510 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2024-09-12 18:24:08,510 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:08,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2024-09-12 18:24:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 18:24:08,511 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:08,511 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:08,538 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 18:24:08,711 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 18:24:08,712 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:08,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash -101728222, now seen corresponding path program 1 times [2024-09-12 18:24:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:08,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994373140] [2024-09-12 18:24:08,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:08,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:08,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:08,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:08,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:08,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-12 18:24:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:24:08,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:08,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994373140] [2024-09-12 18:24:08,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994373140] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:08,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:08,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-12 18:24:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628234623] [2024-09-12 18:24:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:08,871 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 18:24:08,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:08,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 18:24:08,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-12 18:24:08,871 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 18:24:08,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:08,989 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2024-09-12 18:24:08,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 18:24:08,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-12 18:24:08,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:08,990 INFO L225 Difference]: With dead ends: 93 [2024-09-12 18:24:08,990 INFO L226 Difference]: Without dead ends: 91 [2024-09-12 18:24:08,991 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:24:08,991 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:08,991 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 168 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:08,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-09-12 18:24:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-09-12 18:24:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 74 states have (on average 1.364864864864865) internal successors, (101), 78 states have internal predecessors, (101), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2024-09-12 18:24:09,005 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 29 [2024-09-12 18:24:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:09,005 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2024-09-12 18:24:09,005 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 18:24:09,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2024-09-12 18:24:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 18:24:09,006 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:09,006 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:09,006 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 18:24:09,006 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:09,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1789630471, now seen corresponding path program 1 times [2024-09-12 18:24:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418018544] [2024-09-12 18:24:09,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,084 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:09,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:09,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418018544] [2024-09-12 18:24:09,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418018544] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:09,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248192687] [2024-09-12 18:24:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:09,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:09,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:09,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:24:09,100 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 18:24:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 18:24:09,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 18:24:09,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 18:24:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248192687] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:09,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2024-09-12 18:24:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846878189] [2024-09-12 18:24:09,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:09,274 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-12 18:24:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-12 18:24:09,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-09-12 18:24:09,275 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:09,522 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2024-09-12 18:24:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 18:24:09,522 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-09-12 18:24:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:09,523 INFO L225 Difference]: With dead ends: 107 [2024-09-12 18:24:09,523 INFO L226 Difference]: Without dead ends: 106 [2024-09-12 18:24:09,524 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2024-09-12 18:24:09,524 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:09,525 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 323 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-12 18:24:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 70. [2024-09-12 18:24:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 57 states have internal predecessors, (68), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2024-09-12 18:24:09,535 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 28 [2024-09-12 18:24:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:09,536 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-09-12 18:24:09,536 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:09,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2024-09-12 18:24:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 18:24:09,537 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:09,537 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:09,550 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:09,741 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-12 18:24:09,742 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:09,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:09,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1547832465, now seen corresponding path program 1 times [2024-09-12 18:24:09,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:09,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147448925] [2024-09-12 18:24:09,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:09,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-12 18:24:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 18:24:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:24:09,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:09,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147448925] [2024-09-12 18:24:09,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147448925] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:09,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:09,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-12 18:24:09,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590864600] [2024-09-12 18:24:09,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:09,904 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 18:24:09,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:09,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 18:24:09,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-09-12 18:24:09,905 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 11 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 18:24:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:10,021 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-09-12 18:24:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 18:24:10,021 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2024-09-12 18:24:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:10,022 INFO L225 Difference]: With dead ends: 70 [2024-09-12 18:24:10,022 INFO L226 Difference]: Without dead ends: 68 [2024-09-12 18:24:10,023 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-09-12 18:24:10,023 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:10,023 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 177 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-12 18:24:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-09-12 18:24:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 55 states have internal predecessors, (66), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2024-09-12 18:24:10,033 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2024-09-12 18:24:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:10,033 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2024-09-12 18:24:10,033 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 18:24:10,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2024-09-12 18:24:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-12 18:24:10,034 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:10,034 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:10,034 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 18:24:10,035 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:10,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash 712012453, now seen corresponding path program 1 times [2024-09-12 18:24:10,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:10,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10242800] [2024-09-12 18:24:10,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,073 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-12 18:24:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 18:24:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 18:24:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:24:10,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:10,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10242800] [2024-09-12 18:24:10,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10242800] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:10,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:10,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:24:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385595385] [2024-09-12 18:24:10,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:10,078 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:24:10,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:10,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:24:10,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:10,079 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 18:24:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:10,130 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2024-09-12 18:24:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:24:10,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2024-09-12 18:24:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:10,131 INFO L225 Difference]: With dead ends: 75 [2024-09-12 18:24:10,131 INFO L226 Difference]: Without dead ends: 73 [2024-09-12 18:24:10,131 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:10,132 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:10,132 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 95 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:24:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-12 18:24:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-09-12 18:24:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 59 states have internal predecessors, (70), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 18:24:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2024-09-12 18:24:10,142 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 39 [2024-09-12 18:24:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:10,143 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2024-09-12 18:24:10,143 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 18:24:10,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2024-09-12 18:24:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 18:24:10,144 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:10,144 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:10,144 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 18:24:10,144 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:10,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:10,145 INFO L85 PathProgramCache]: Analyzing trace with hash 442930523, now seen corresponding path program 2 times [2024-09-12 18:24:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:10,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792341800] [2024-09-12 18:24:10,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:10,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:10,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792341800] [2024-09-12 18:24:10,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792341800] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:10,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042595005] [2024-09-12 18:24:10,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:24:10,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:10,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:10,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:24:10,261 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 18:24:10,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 18:24:10,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:24:10,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:24:10,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 18:24:10,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 18:24:10,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042595005] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:10,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:10,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 20 [2024-09-12 18:24:10,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762853700] [2024-09-12 18:24:10,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:10,540 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-12 18:24:10,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:10,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-12 18:24:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-09-12 18:24:10,545 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 18:24:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:11,446 INFO L93 Difference]: Finished difference Result 230 states and 292 transitions. [2024-09-12 18:24:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-09-12 18:24:11,446 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2024-09-12 18:24:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:11,447 INFO L225 Difference]: With dead ends: 230 [2024-09-12 18:24:11,447 INFO L226 Difference]: Without dead ends: 229 [2024-09-12 18:24:11,448 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=645, Invalid=2547, Unknown=0, NotChecked=0, Total=3192 [2024-09-12 18:24:11,449 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 386 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:11,449 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 204 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-09-12 18:24:11,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 48. [2024-09-12 18:24:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 18:24:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2024-09-12 18:24:11,461 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 37 [2024-09-12 18:24:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:11,462 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2024-09-12 18:24:11,462 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 18:24:11,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2024-09-12 18:24:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-12 18:24:11,463 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:11,463 INFO L216 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] [2024-09-12 18:24:11,477 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 18:24:11,667 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:11,668 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:11,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1891295657, now seen corresponding path program 1 times [2024-09-12 18:24:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143995289] [2024-09-12 18:24:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:11,751 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:11,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:11,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:11,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-12 18:24:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:11,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 18:24:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:11,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 18:24:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:11,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-12 18:24:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 18:24:11,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143995289] [2024-09-12 18:24:11,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143995289] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025490252] [2024-09-12 18:24:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:11,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:11,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:11,770 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:24:11,771 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 18:24:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:11,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:24:11,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:24:11,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:11,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025490252] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:11,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:24:11,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-09-12 18:24:11,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497072461] [2024-09-12 18:24:11,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:11,895 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 18:24:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:11,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 18:24:11,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-09-12 18:24:11,896 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 18:24:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:11,992 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2024-09-12 18:24:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 18:24:11,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 48 [2024-09-12 18:24:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:11,993 INFO L225 Difference]: With dead ends: 93 [2024-09-12 18:24:11,993 INFO L226 Difference]: Without dead ends: 71 [2024-09-12 18:24:11,994 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-09-12 18:24:11,994 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 23 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:11,994 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 173 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-12 18:24:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2024-09-12 18:24:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 18:24:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2024-09-12 18:24:12,005 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 48 [2024-09-12 18:24:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:12,005 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-09-12 18:24:12,005 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 18:24:12,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-09-12 18:24:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-12 18:24:12,008 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:12,008 INFO L216 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] [2024-09-12 18:24:12,021 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:12,208 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-12 18:24:12,209 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:12,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:12,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1201730466, now seen corresponding path program 1 times [2024-09-12 18:24:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021432648] [2024-09-12 18:24:12,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 18:24:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 18:24:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 18:24:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,307 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 18:24:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-12 18:24:12,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:12,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021432648] [2024-09-12 18:24:12,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021432648] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:12,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:12,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 18:24:12,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606866969] [2024-09-12 18:24:12,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:12,309 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 18:24:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 18:24:12,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:24:12,310 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 18:24:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:12,385 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2024-09-12 18:24:12,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:24:12,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2024-09-12 18:24:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:12,386 INFO L225 Difference]: With dead ends: 82 [2024-09-12 18:24:12,386 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 18:24:12,387 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:12,387 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:12,387 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 85 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 18:24:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-12 18:24:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 18:24:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-09-12 18:24:12,397 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 52 [2024-09-12 18:24:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:12,397 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-09-12 18:24:12,397 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 18:24:12,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-09-12 18:24:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-12 18:24:12,398 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:12,398 INFO L216 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] [2024-09-12 18:24:12,398 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 18:24:12,398 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:12,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash 628132964, now seen corresponding path program 1 times [2024-09-12 18:24:12,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9911041] [2024-09-12 18:24:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 18:24:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 18:24:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 18:24:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 18:24:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 18:24:12,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:12,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9911041] [2024-09-12 18:24:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9911041] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:12,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139773955] [2024-09-12 18:24:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:12,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:12,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:12,477 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:24:12,486 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 18:24:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:24:12,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 18:24:12,555 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:12,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139773955] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:12,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:24:12,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-09-12 18:24:12,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460801805] [2024-09-12 18:24:12,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:12,556 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:24:12,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:12,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:24:12,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:12,557 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 18:24:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:12,583 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2024-09-12 18:24:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:24:12,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2024-09-12 18:24:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:12,584 INFO L225 Difference]: With dead ends: 47 [2024-09-12 18:24:12,584 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 18:24:12,584 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:12,585 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:12,585 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:24:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 18:24:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-12 18:24:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 18:24:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-09-12 18:24:12,593 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 52 [2024-09-12 18:24:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:12,594 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-09-12 18:24:12,594 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 18:24:12,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-09-12 18:24:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-12 18:24:12,594 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:12,594 INFO L216 NwaCegarLoop]: trace histogram [3, 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] [2024-09-12 18:24:12,608 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:12,795 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-12 18:24:12,795 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:12,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2002714503, now seen corresponding path program 1 times [2024-09-12 18:24:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300005201] [2024-09-12 18:24:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 18:24:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 18:24:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 18:24:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 18:24:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 18:24:12,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300005201] [2024-09-12 18:24:12,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300005201] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552378118] [2024-09-12 18:24:12,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:12,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:12,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:12,862 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:24:12,867 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 18:24:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:12,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:24:12,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 18:24:12,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 18:24:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552378118] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:12,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-09-12 18:24:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913981880] [2024-09-12 18:24:12,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:12,987 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 18:24:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:12,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 18:24:12,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:24:12,988 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-09-12 18:24:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:13,077 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-09-12 18:24:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 18:24:13,077 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 53 [2024-09-12 18:24:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:13,078 INFO L225 Difference]: With dead ends: 62 [2024-09-12 18:24:13,078 INFO L226 Difference]: Without dead ends: 61 [2024-09-12 18:24:13,078 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:24:13,079 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:13,079 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 137 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-12 18:24:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-09-12 18:24:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:24:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-09-12 18:24:13,111 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 53 [2024-09-12 18:24:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:13,111 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-09-12 18:24:13,112 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-09-12 18:24:13,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-09-12 18:24:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-09-12 18:24:13,112 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:13,113 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 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] [2024-09-12 18:24:13,129 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 18:24:13,316 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-12 18:24:13,317 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:13,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1817996691, now seen corresponding path program 2 times [2024-09-12 18:24:13,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:13,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373892948] [2024-09-12 18:24:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:13,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,495 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,507 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 18:24:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 18:24:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,512 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 18:24:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 18:24:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-12 18:24:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-12 18:24:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-12 18:24:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-12 18:24:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373892948] [2024-09-12 18:24:13,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373892948] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109419243] [2024-09-12 18:24:13,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:24:13,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:13,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:13,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:24:13,523 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 18:24:13,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:24:13,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:24:13,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 18:24:13,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 73 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-09-12 18:24:13,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-09-12 18:24:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109419243] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:13,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:13,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 31 [2024-09-12 18:24:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596449515] [2024-09-12 18:24:13,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:13,936 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-12 18:24:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:13,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-12 18:24:13,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2024-09-12 18:24:13,938 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 31 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 30 states have internal predecessors, (77), 10 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-12 18:24:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:14,175 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2024-09-12 18:24:14,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 18:24:14,176 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 30 states have internal predecessors, (77), 10 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) Word has length 80 [2024-09-12 18:24:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:14,177 INFO L225 Difference]: With dead ends: 101 [2024-09-12 18:24:14,177 INFO L226 Difference]: Without dead ends: 66 [2024-09-12 18:24:14,177 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 162 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2024-09-12 18:24:14,178 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:14,178 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 249 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-12 18:24:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-09-12 18:24:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:24:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-09-12 18:24:14,191 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 80 [2024-09-12 18:24:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:14,192 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-09-12 18:24:14,192 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 30 states have internal predecessors, (77), 10 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-12 18:24:14,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-09-12 18:24:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-09-12 18:24:14,193 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:14,193 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 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] [2024-09-12 18:24:14,207 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-12 18:24:14,394 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:14,394 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:14,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1015049294, now seen corresponding path program 3 times [2024-09-12 18:24:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:14,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543796808] [2024-09-12 18:24:14,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 18:24:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 18:24:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-12 18:24:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 18:24:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-12 18:24:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-12 18:24:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-12 18:24:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-12 18:24:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 35 proven. 17 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-09-12 18:24:14,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543796808] [2024-09-12 18:24:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543796808] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394087310] [2024-09-12 18:24:14,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 18:24:14,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:14,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:14,624 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:24:14,630 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-12 18:24:14,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-12 18:24:14,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:24:14,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:24:14,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-09-12 18:24:14,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-09-12 18:24:14,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394087310] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:14,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:14,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 4, 4] total 20 [2024-09-12 18:24:14,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819552935] [2024-09-12 18:24:14,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:14,836 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 18:24:14,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:14,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 18:24:14,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-09-12 18:24:14,837 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-12 18:24:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:15,148 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-09-12 18:24:15,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 18:24:15,149 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 84 [2024-09-12 18:24:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:15,149 INFO L225 Difference]: With dead ends: 104 [2024-09-12 18:24:15,149 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 18:24:15,150 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2024-09-12 18:24:15,151 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:15,151 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 139 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 18:24:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 18:24:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 18:24:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 18:24:15,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2024-09-12 18:24:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:15,151 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 18:24:15,151 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-12 18:24:15,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 18:24:15,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 18:24:15,154 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 9 remaining) [2024-09-12 18:24:15,154 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2024-09-12 18:24:15,155 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2024-09-12 18:24:15,155 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2024-09-12 18:24:15,155 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2024-09-12 18:24:15,155 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2024-09-12 18:24:15,155 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2024-09-12 18:24:15,155 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2024-09-12 18:24:15,155 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-09-12 18:24:15,169 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:15,356 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-12 18:24:15,359 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:15,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 18:24:29,370 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 18:24:29,376 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:57) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:116) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-09-12 18:24:29,379 INFO L158 Benchmark]: Toolchain (without parser) took 24062.32ms. Allocated memory was 86.0MB in the beginning and 1.5GB in the end (delta: 1.5GB). Free memory was 47.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 914.2MB. Max. memory is 16.1GB. [2024-09-12 18:24:29,379 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 86.0MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:24:29,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.71ms. Allocated memory is still 86.0MB. Free memory was 47.4MB in the beginning and 62.0MB in the end (delta: -14.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-09-12 18:24:29,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.03ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 60.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:24:29,379 INFO L158 Benchmark]: Boogie Preprocessor took 40.62ms. Allocated memory is still 86.0MB. Free memory was 60.9MB in the beginning and 58.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:24:29,380 INFO L158 Benchmark]: RCFGBuilder took 360.28ms. Allocated memory is still 86.0MB. Free memory was 58.9MB in the beginning and 43.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-12 18:24:29,380 INFO L158 Benchmark]: TraceAbstraction took 23418.22ms. Allocated memory was 86.0MB in the beginning and 1.5GB in the end (delta: 1.5GB). Free memory was 43.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 907.0MB. Max. memory is 16.1GB. [2024-09-12 18:24:29,381 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 86.0MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.71ms. Allocated memory is still 86.0MB. Free memory was 47.4MB in the beginning and 62.0MB in the end (delta: -14.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.03ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 60.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.62ms. Allocated memory is still 86.0MB. Free memory was 60.9MB in the beginning and 58.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 360.28ms. Allocated memory is still 86.0MB. Free memory was 58.9MB in the beginning and 43.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23418.22ms. Allocated memory was 86.0MB in the beginning and 1.5GB in the end (delta: 1.5GB). Free memory was 43.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 907.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 939 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 879 mSDsluCounter, 2725 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2123 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3146 IncrementalHoareTripleChecker+Invalid, 3351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 602 mSDtfsCounter, 3146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1110 GetRequests, 853 SyntacticMatches, 6 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=8, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 332 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1111 NumberOfCodeBlocks, 1053 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1385 ConstructedInterpolants, 0 QuantifiedInterpolants, 3000 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1209 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 33 InterpolantComputations, 12 PerfectInterpolantSequences, 871/1051 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-09-12 18:24:29,404 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 18:24:32,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:24:32,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-12 18:24:32,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:24:32,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:24:32,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:24:32,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:24:32,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:24:32,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:24:32,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:24:32,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:24:32,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:24:32,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:24:32,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:24:32,140 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:24:32,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:24:32,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:24:32,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:24:32,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:24:32,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:24:32,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:24:32,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:24:32,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:24:32,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-12 18:24:32,146 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-12 18:24:32,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:24:32,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-12 18:24:32,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:24:32,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:24:32,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:24:32,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:24:32,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:24:32,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:24:32,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:24:32,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:24:32,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:24:32,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:24:32,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:24:32,152 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-12 18:24:32,152 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-12 18:24:32,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:24:32,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:24:32,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:24:32,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:24:32,153 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-12 18:24:32,153 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 18:24:32,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:24:32,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:24:32,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:24:32,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:24:32,491 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:24:32,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max.c [2024-09-12 18:24:34,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:24:34,152 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:24:34,153 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c [2024-09-12 18:24:34,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/3753e874b/fc38584385c24ffcbc185ce3ebe6256a/FLAG57517d4fd [2024-09-12 18:24:34,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/3753e874b/fc38584385c24ffcbc185ce3ebe6256a [2024-09-12 18:24:34,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:24:34,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:24:34,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:24:34,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:24:34,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:24:34,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534b87af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34, skipping insertion in model container [2024-09-12 18:24:34,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:24:34,300 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-12 18:24:34,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:24:34,324 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:24:34,333 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-12 18:24:34,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:24:34,351 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:24:34,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34 WrapperNode [2024-09-12 18:24:34,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:24:34,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:24:34,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:24:34,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:24:34,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,368 INFO L138 Inliner]: procedures = 20, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:24:34,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:24:34,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:24:34,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:24:34,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:24:34,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,399 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-12 18:24:34,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:24:34,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:24:34,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:24:34,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:24:34,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (1/1) ... [2024-09-12 18:24:34,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:24:34,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:34,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 18:24:34,449 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 18:24:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-12 18:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-12 18:24:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 18:24:34,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 18:24:34,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:24:34,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:24:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:24:34,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:24:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-12 18:24:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-12 18:24:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-12 18:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:24:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-12 18:24:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-12 18:24:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 18:24:34,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 18:24:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 18:24:34,569 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:24:34,572 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:24:34,881 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-12 18:24:34,881 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:24:34,923 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:24:34,923 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 18:24:34,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:24:34 BoogieIcfgContainer [2024-09-12 18:24:34,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:24:34,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:24:34,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:24:34,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:24:34,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:24:34" (1/3) ... [2024-09-12 18:24:34,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470cfdff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:24:34, skipping insertion in model container [2024-09-12 18:24:34,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:34" (2/3) ... [2024-09-12 18:24:34,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470cfdff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:24:34, skipping insertion in model container [2024-09-12 18:24:34,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:24:34" (3/3) ... [2024-09-12 18:24:34,943 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-09-12 18:24:34,960 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:24:34,961 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-09-12 18:24:35,037 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:24:35,046 INFO L336 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=All, 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;@63a4fe17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:24:35,046 INFO L337 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-09-12 18:24:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 38 states have internal predecessors, (45), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 18:24:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 18:24:35,057 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:35,058 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:35,058 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:35,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:35,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2124994698, now seen corresponding path program 1 times [2024-09-12 18:24:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:35,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377022444] [2024-09-12 18:24:35,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:35,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:35,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:35,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:35,090 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-09-12 18:24:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:35,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-12 18:24:35,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:35,191 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:35,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:35,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377022444] [2024-09-12 18:24:35,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377022444] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:35,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:35,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:24:35,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136858886] [2024-09-12 18:24:35,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:35,200 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 18:24:35,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 18:24:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 18:24:35,232 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 38 states have internal predecessors, (45), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:24:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:35,274 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2024-09-12 18:24:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 18:24:35,278 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-09-12 18:24:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:35,284 INFO L225 Difference]: With dead ends: 92 [2024-09-12 18:24:35,284 INFO L226 Difference]: Without dead ends: 43 [2024-09-12 18:24:35,288 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 18:24:35,292 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:35,292 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:24:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-12 18:24:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-12 18:24:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 31 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-12 18:24:35,341 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2024-09-12 18:24:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:35,341 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-12 18:24:35,341 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:24:35,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-12 18:24:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 18:24:35,343 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:35,343 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:35,351 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:35,551 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:35,552 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:35,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1489914228, now seen corresponding path program 1 times [2024-09-12 18:24:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:35,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869428923] [2024-09-12 18:24:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:35,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:35,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:35,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:35,560 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-09-12 18:24:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:35,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:24:35,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:35,698 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:35,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:35,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869428923] [2024-09-12 18:24:35,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869428923] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:35,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:35,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:24:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085948647] [2024-09-12 18:24:35,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:35,700 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:24:35,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:35,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:24:35,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:35,706 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:24:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:35,758 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-09-12 18:24:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:24:35,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-09-12 18:24:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:35,759 INFO L225 Difference]: With dead ends: 43 [2024-09-12 18:24:35,759 INFO L226 Difference]: Without dead ends: 42 [2024-09-12 18:24:35,760 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:35,761 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:35,761 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 116 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:24:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-12 18:24:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-12 18:24:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-09-12 18:24:35,767 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 16 [2024-09-12 18:24:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:35,768 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-09-12 18:24:35,769 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:24:35,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-09-12 18:24:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 18:24:35,770 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:35,770 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:35,780 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-09-12 18:24:35,973 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:35,974 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:35,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1288613865, now seen corresponding path program 1 times [2024-09-12 18:24:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413887412] [2024-09-12 18:24:35,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:35,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:35,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:35,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:35,980 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-09-12 18:24:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:36,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:24:36,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:36,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:36,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413887412] [2024-09-12 18:24:36,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413887412] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:36,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:24:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336920696] [2024-09-12 18:24:36,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:36,037 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:24:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:24:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:36,038 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:36,112 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-09-12 18:24:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:24:36,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-09-12 18:24:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:36,114 INFO L225 Difference]: With dead ends: 65 [2024-09-12 18:24:36,114 INFO L226 Difference]: Without dead ends: 64 [2024-09-12 18:24:36,114 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:24:36,115 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 21 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:36,115 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 158 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:24:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-12 18:24:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2024-09-12 18:24:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 39 states have internal predecessors, (47), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2024-09-12 18:24:36,125 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 20 [2024-09-12 18:24:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:36,125 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-09-12 18:24:36,125 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:36,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-09-12 18:24:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 18:24:36,126 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:36,126 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:36,131 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-09-12 18:24:36,327 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:36,328 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:36,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1292330041, now seen corresponding path program 1 times [2024-09-12 18:24:36,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:36,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314201699] [2024-09-12 18:24:36,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:36,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:36,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:36,331 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:36,332 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-09-12 18:24:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:36,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 18:24:36,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:36,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:36,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:36,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314201699] [2024-09-12 18:24:36,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314201699] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:36,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:36,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:24:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928752520] [2024-09-12 18:24:36,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:36,399 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:24:36,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:36,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:24:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:24:36,400 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:36,439 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-09-12 18:24:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:24:36,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-09-12 18:24:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:36,441 INFO L225 Difference]: With dead ends: 65 [2024-09-12 18:24:36,441 INFO L226 Difference]: Without dead ends: 64 [2024-09-12 18:24:36,441 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:24:36,442 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:36,445 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 120 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:24:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-12 18:24:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2024-09-12 18:24:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-09-12 18:24:36,453 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 21 [2024-09-12 18:24:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:36,453 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-09-12 18:24:36,453 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:36,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-09-12 18:24:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 18:24:36,454 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:36,455 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:36,460 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:36,656 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:36,657 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:36,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash 172048876, now seen corresponding path program 1 times [2024-09-12 18:24:36,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:36,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012001468] [2024-09-12 18:24:36,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:36,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:36,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:36,661 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:36,662 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-09-12 18:24:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:36,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:24:36,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:36,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:36,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:36,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012001468] [2024-09-12 18:24:36,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012001468] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:36,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:24:36,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-09-12 18:24:36,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259147590] [2024-09-12 18:24:36,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:36,803 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 18:24:36,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:36,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 18:24:36,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-09-12 18:24:36,804 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:36,972 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2024-09-12 18:24:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 18:24:36,972 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-12 18:24:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:36,974 INFO L225 Difference]: With dead ends: 123 [2024-09-12 18:24:36,974 INFO L226 Difference]: Without dead ends: 122 [2024-09-12 18:24:36,974 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-09-12 18:24:36,975 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 72 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:36,975 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 327 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-12 18:24:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 50. [2024-09-12 18:24:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-09-12 18:24:36,993 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 25 [2024-09-12 18:24:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:36,994 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-09-12 18:24:36,994 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:36,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-09-12 18:24:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 18:24:36,995 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:36,995 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:37,003 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:37,197 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:37,198 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:37,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:37,199 INFO L85 PathProgramCache]: Analyzing trace with hash -101728222, now seen corresponding path program 1 times [2024-09-12 18:24:37,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:37,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40505654] [2024-09-12 18:24:37,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:37,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:37,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:37,203 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:37,204 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-09-12 18:24:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:37,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-12 18:24:37,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:37,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 18:24:37,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 18:24:37,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2024-09-12 18:24:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:24:37,538 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:37,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:37,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40505654] [2024-09-12 18:24:37,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40505654] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:37,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:37,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-09-12 18:24:37,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854221923] [2024-09-12 18:24:37,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:37,540 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 18:24:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:37,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 18:24:37,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:24:37,541 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 18:24:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:38,059 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2024-09-12 18:24:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 18:24:38,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-09-12 18:24:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:38,061 INFO L225 Difference]: With dead ends: 86 [2024-09-12 18:24:38,061 INFO L226 Difference]: Without dead ends: 84 [2024-09-12 18:24:38,061 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-09-12 18:24:38,062 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 50 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:38,062 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 350 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:24:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-12 18:24:38,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 59. [2024-09-12 18:24:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 18:24:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2024-09-12 18:24:38,080 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 29 [2024-09-12 18:24:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:38,080 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2024-09-12 18:24:38,080 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 18:24:38,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2024-09-12 18:24:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 18:24:38,082 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:38,082 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:38,087 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-09-12 18:24:38,284 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:38,285 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:38,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:38,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1789630471, now seen corresponding path program 1 times [2024-09-12 18:24:38,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:38,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349503289] [2024-09-12 18:24:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:38,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:38,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:38,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:38,296 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-09-12 18:24:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 18:24:38,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 18:24:38,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:24:38,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:38,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349503289] [2024-09-12 18:24:38,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349503289] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:38,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:24:38,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-09-12 18:24:38,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105578823] [2024-09-12 18:24:38,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:38,426 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:24:38,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:38,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:24:38,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:38,427 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:38,477 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-09-12 18:24:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:24:38,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-09-12 18:24:38,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:38,480 INFO L225 Difference]: With dead ends: 60 [2024-09-12 18:24:38,480 INFO L226 Difference]: Without dead ends: 59 [2024-09-12 18:24:38,481 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:38,481 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:38,481 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:24:38,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-12 18:24:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2024-09-12 18:24:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 18:24:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-09-12 18:24:38,495 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 28 [2024-09-12 18:24:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:38,496 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-09-12 18:24:38,496 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 18:24:38,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-09-12 18:24:38,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 18:24:38,497 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:38,497 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:38,508 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-09-12 18:24:38,697 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:38,698 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:38,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1417662349, now seen corresponding path program 1 times [2024-09-12 18:24:38,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:38,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502874029] [2024-09-12 18:24:38,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:38,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:38,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:38,703 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:38,705 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-09-12 18:24:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-12 18:24:38,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:39,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 18:24:39,599 INFO L349 Elim1Store]: treesize reduction 64, result has 39.0 percent of original size [2024-09-12 18:24:39,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 55 [2024-09-12 18:24:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:39,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:40,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:40,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502874029] [2024-09-12 18:24:40,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502874029] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:40,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1229482145] [2024-09-12 18:24:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:40,015 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-12 18:24:40,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-12 18:24:40,034 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-12 18:24:40,049 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-09-12 18:24:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:40,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:24:40,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:40,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-12 18:24:40,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-09-12 18:24:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:40,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1229482145] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:40,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:24:40,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2024-09-12 18:24:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628042263] [2024-09-12 18:24:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:40,295 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:24:40,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:40,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:24:40,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2024-09-12 18:24:40,296 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 18:24:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:40,380 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2024-09-12 18:24:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:24:40,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-09-12 18:24:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:40,381 INFO L225 Difference]: With dead ends: 74 [2024-09-12 18:24:40,381 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 18:24:40,382 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2024-09-12 18:24:40,382 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:40,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 130 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 18:24:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-12 18:24:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 18:24:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-09-12 18:24:40,397 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 33 [2024-09-12 18:24:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:40,397 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-09-12 18:24:40,398 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 18:24:40,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-09-12 18:24:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 18:24:40,400 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:40,400 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:40,408 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-09-12 18:24:40,604 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-09-12 18:24:40,803 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-12 18:24:40,803 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:40,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:40,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1461088583, now seen corresponding path program 1 times [2024-09-12 18:24:40,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:40,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260112704] [2024-09-12 18:24:40,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:40,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:40,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:40,809 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:40,810 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-09-12 18:24:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:40,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-12 18:24:40,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:41,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 18:24:41,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 18:24:41,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 18:24:41,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 18:24:41,541 INFO L349 Elim1Store]: treesize reduction 50, result has 46.8 percent of original size [2024-09-12 18:24:41,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 47 treesize of output 56 [2024-09-12 18:24:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:41,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:41,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260112704] [2024-09-12 18:24:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260112704] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [147115836] [2024-09-12 18:24:41,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:41,845 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-12 18:24:41,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-12 18:24:41,848 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-12 18:24:41,855 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-09-12 18:24:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:41,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 18:24:41,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:41,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-12 18:24:52,171 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| v_main_~a~0.base_BEFORE_CALL_3))) is different from true [2024-09-12 18:24:52,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-09-12 18:24:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 18:24:52,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:52,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [147115836] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:52,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:24:52,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 24 [2024-09-12 18:24:52,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247125580] [2024-09-12 18:24:52,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:52,848 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 18:24:52,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:52,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 18:24:52,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=626, Unknown=2, NotChecked=50, Total=756 [2024-09-12 18:24:52,849 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 18:24:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:53,084 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2024-09-12 18:24:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 18:24:53,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-09-12 18:24:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:53,085 INFO L225 Difference]: With dead ends: 57 [2024-09-12 18:24:53,085 INFO L226 Difference]: Without dead ends: 55 [2024-09-12 18:24:53,086 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=92, Invalid=722, Unknown=2, NotChecked=54, Total=870 [2024-09-12 18:24:53,086 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:53,087 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 178 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 67 Unchecked, 0.2s Time] [2024-09-12 18:24:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-12 18:24:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2024-09-12 18:24:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 18:24:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2024-09-12 18:24:53,097 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 33 [2024-09-12 18:24:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:53,098 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-09-12 18:24:53,098 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 18:24:53,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2024-09-12 18:24:53,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 18:24:53,099 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:53,099 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:53,105 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-09-12 18:24:53,302 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:53,501 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-12 18:24:53,502 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:53,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1547832465, now seen corresponding path program 1 times [2024-09-12 18:24:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359239007] [2024-09-12 18:24:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:53,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:53,504 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:53,506 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-09-12 18:24:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:53,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:24:53,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:53,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-12 18:24:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:24:53,645 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:53,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:53,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359239007] [2024-09-12 18:24:53,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359239007] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:53,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:53,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 18:24:53,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246693387] [2024-09-12 18:24:53,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:53,646 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 18:24:53,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:53,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 18:24:53,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:24:53,646 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 18:24:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:53,826 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2024-09-12 18:24:53,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:24:53,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2024-09-12 18:24:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:53,828 INFO L225 Difference]: With dead ends: 68 [2024-09-12 18:24:53,828 INFO L226 Difference]: Without dead ends: 66 [2024-09-12 18:24:53,828 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:53,829 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:53,829 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 160 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-12 18:24:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2024-09-12 18:24:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 18:24:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-09-12 18:24:53,842 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 36 [2024-09-12 18:24:53,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:53,843 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-09-12 18:24:53,843 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 18:24:53,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-09-12 18:24:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 18:24:53,844 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:53,844 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:53,851 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-09-12 18:24:54,044 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:54,045 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:54,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash 597549656, now seen corresponding path program 1 times [2024-09-12 18:24:54,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:54,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341921612] [2024-09-12 18:24:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:54,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:54,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:54,049 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:54,049 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-09-12 18:24:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:54,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 18:24:54,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:24:54,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:54,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341921612] [2024-09-12 18:24:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341921612] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:54,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:24:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419849631] [2024-09-12 18:24:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:54,127 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:24:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:54,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:24:54,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:24:54,128 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 18:24:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:54,194 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-09-12 18:24:54,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:24:54,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2024-09-12 18:24:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:54,196 INFO L225 Difference]: With dead ends: 64 [2024-09-12 18:24:54,196 INFO L226 Difference]: Without dead ends: 63 [2024-09-12 18:24:54,196 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:24:54,196 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:54,197 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:24:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-12 18:24:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-12 18:24:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 45 states have internal predecessors, (47), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:24:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2024-09-12 18:24:54,212 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2024-09-12 18:24:54,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:54,213 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2024-09-12 18:24:54,213 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 18:24:54,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2024-09-12 18:24:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 18:24:54,214 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:54,214 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:54,218 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:54,417 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:54,417 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:24:54,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:54,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1142048820, now seen corresponding path program 1 times [2024-09-12 18:24:54,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:24:54,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814521762] [2024-09-12 18:24:54,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:54,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:24:54,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:24:54,420 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:24:54,422 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-09-12 18:24:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:54,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 18:24:54,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:55,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 18:24:55,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 18:24:55,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 18:24:55,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 13 [2024-09-12 18:24:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:55,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:56,377 INFO L349 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2024-09-12 18:24:56,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 24 [2024-09-12 18:24:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:24:56,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:24:56,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814521762] [2024-09-12 18:24:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814521762] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:56,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:24:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2024-09-12 18:24:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990613358] [2024-09-12 18:24:56,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:56,605 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-12 18:24:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:24:56,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-12 18:24:56,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2024-09-12 18:24:56,606 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 23 states have internal predecessors, (49), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-12 18:25:00,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:25:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:25:04,840 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2024-09-12 18:25:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-12 18:25:04,841 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 23 states have internal predecessors, (49), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 40 [2024-09-12 18:25:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:25:04,842 INFO L225 Difference]: With dead ends: 118 [2024-09-12 18:25:04,842 INFO L226 Difference]: Without dead ends: 116 [2024-09-12 18:25:04,843 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=294, Invalid=1962, Unknown=0, NotChecked=0, Total=2256 [2024-09-12 18:25:04,843 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 131 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-09-12 18:25:04,844 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 492 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 603 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-09-12 18:25:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-09-12 18:25:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 71. [2024-09-12 18:25:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:25:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2024-09-12 18:25:04,869 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 40 [2024-09-12 18:25:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:25:04,870 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2024-09-12 18:25:04,870 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 23 states have internal predecessors, (49), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-12 18:25:04,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:25:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2024-09-12 18:25:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-12 18:25:04,871 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:25:04,871 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:25:04,878 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-09-12 18:25:05,073 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:25:05,074 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:25:05,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:25:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash -657351667, now seen corresponding path program 1 times [2024-09-12 18:25:05,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:25:05,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788175112] [2024-09-12 18:25:05,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:25:05,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:25:05,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:25:05,077 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:25:05,080 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-09-12 18:25:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:05,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-12 18:25:05,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:25:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:25:05,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:25:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:25:05,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:25:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788175112] [2024-09-12 18:25:05,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788175112] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:25:05,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:25:05,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-09-12 18:25:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827338950] [2024-09-12 18:25:05,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:25:05,876 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 18:25:05,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:25:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 18:25:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-09-12 18:25:05,877 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 18:25:06,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:25:06,655 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2024-09-12 18:25:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 18:25:06,656 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 45 [2024-09-12 18:25:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:25:06,658 INFO L225 Difference]: With dead ends: 94 [2024-09-12 18:25:06,658 INFO L226 Difference]: Without dead ends: 71 [2024-09-12 18:25:06,659 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2024-09-12 18:25:06,662 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 18:25:06,662 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 234 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 18:25:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-12 18:25:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-09-12 18:25:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 53 states have internal predecessors, (56), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:25:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2024-09-12 18:25:06,691 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 45 [2024-09-12 18:25:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:25:06,692 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2024-09-12 18:25:06,692 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 18:25:06,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:25:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2024-09-12 18:25:06,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-12 18:25:06,694 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:25:06,694 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:25:06,698 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-09-12 18:25:06,894 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:25:06,895 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:25:06,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:25:06,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1157849906, now seen corresponding path program 1 times [2024-09-12 18:25:06,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:25:06,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267004897] [2024-09-12 18:25:06,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:25:06,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:25:06,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:25:06,898 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:25:06,900 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-09-12 18:25:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:06,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 18:25:06,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:25:07,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-09-12 18:25:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:25:07,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:25:07,364 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-09-12 18:25:07,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-09-12 18:25:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:25:07,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:25:07,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267004897] [2024-09-12 18:25:07,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267004897] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:25:07,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:25:07,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-09-12 18:25:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596205617] [2024-09-12 18:25:07,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:25:07,683 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 18:25:07,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:25:07,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 18:25:07,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-09-12 18:25:07,684 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 20 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 7 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-12 18:25:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:25:08,331 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-09-12 18:25:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 18:25:08,331 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 7 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 49 [2024-09-12 18:25:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:25:08,332 INFO L225 Difference]: With dead ends: 96 [2024-09-12 18:25:08,332 INFO L226 Difference]: Without dead ends: 94 [2024-09-12 18:25:08,333 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-09-12 18:25:08,333 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 18:25:08,333 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 385 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 18:25:08,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-12 18:25:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2024-09-12 18:25:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-12 18:25:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-09-12 18:25:08,367 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 49 [2024-09-12 18:25:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:25:08,367 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-09-12 18:25:08,367 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 7 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-12 18:25:08,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:25:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-09-12 18:25:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-12 18:25:08,368 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:25:08,368 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:25:08,373 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-09-12 18:25:08,569 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:25:08,569 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 18:25:08,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:25:08,570 INFO L85 PathProgramCache]: Analyzing trace with hash 564235714, now seen corresponding path program 2 times [2024-09-12 18:25:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 18:25:08,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200684644] [2024-09-12 18:25:08,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:25:08,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 18:25:08,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 18:25:08,572 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 18:25:08,574 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-09-12 18:25:08,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:25:08,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:25:08,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-12 18:25:08,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:25:10,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 18:25:10,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 18:25:10,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 18:25:10,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 13 [2024-09-12 18:25:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:25:10,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:26:41,275 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-09-12 18:26:41,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 22 [2024-09-12 18:26:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:26:41,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 18:26:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200684644] [2024-09-12 18:26:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200684644] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:26:41,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:26:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 38 [2024-09-12 18:26:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574250481] [2024-09-12 18:26:41,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:26:41,777 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-12 18:26:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 18:26:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-12 18:26:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1244, Unknown=22, NotChecked=0, Total=1406 [2024-09-12 18:26:41,778 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 35 states have internal predecessors, (65), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-12 18:26:45,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:26:50,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:26:54,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:26:58,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:27:02,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:27:23,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:27:27,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:27:31,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:27:35,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:27:39,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:27:43,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:27:55,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:27:59,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:28:11,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:28:15,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:28:19,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:28:23,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 18:28:43,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]