./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.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/prefixsum_iter.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 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --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:21,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:24:21,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:24:21,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:24:21,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:24:21,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:24:21,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:24:21,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:24:21,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:24:21,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:24:21,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:24:21,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:24:21,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:24:21,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:24:21,393 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:24:21,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:24:21,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:24:21,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:24:21,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:24:21,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:24:21,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:24:21,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:24:21,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:24:21,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:24:21,400 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:24:21,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:24:21,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:24:21,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:24:21,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:24:21,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:24:21,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:24:21,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:24:21,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:24:21,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:24:21,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:24:21,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:24:21,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:24:21,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:24:21,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:24:21,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:24:21,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:24:21,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:24:21,406 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 -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d 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:21,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:24:21,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:24:21,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:24:21,789 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:24:21,789 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:24:21,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/prefixsum_iter.c [2024-09-12 18:24:23,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:24:23,697 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:24:23,698 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/prefixsum_iter.c [2024-09-12 18:24:23,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/598271466/50e566e5a9a242768ba778cee0df8bf4/FLAGde9588277 [2024-09-12 18:24:23,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/598271466/50e566e5a9a242768ba778cee0df8bf4 [2024-09-12 18:24:23,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:24:23,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:24:23,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:24:23,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:24:23,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:24:23,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:24:23" (1/1) ... [2024-09-12 18:24:23,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7445fdfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:23, skipping insertion in model container [2024-09-12 18:24:23,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:24:23" (1/1) ... [2024-09-12 18:24:23,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:24:23,913 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/prefixsum_iter.c[526,539] [2024-09-12 18:24:23,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:24:23,973 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:24:23,986 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/prefixsum_iter.c[526,539] [2024-09-12 18:24:24,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:24:24,030 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:24:24,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:24 WrapperNode [2024-09-12 18:24:24,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:24:24,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:24:24,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:24:24,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:24:24,039 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:24" (1/1) ... [2024-09-12 18:24:24,054 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:24" (1/1) ... [2024-09-12 18:24:24,069 INFO L138 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:24:24,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:24:24,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:24:24,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:24:24,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:24:24,090 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:24" (1/1) ... [2024-09-12 18:24:24,090 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:24" (1/1) ... [2024-09-12 18:24:24,094 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:24" (1/1) ... [2024-09-12 18:24:24,124 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-09-12 18:24:24,125 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:24" (1/1) ... [2024-09-12 18:24:24,125 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:24" (1/1) ... [2024-09-12 18:24:24,138 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:24" (1/1) ... [2024-09-12 18:24:24,145 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:24" (1/1) ... [2024-09-12 18:24:24,149 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:24" (1/1) ... [2024-09-12 18:24:24,150 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:24" (1/1) ... [2024-09-12 18:24:24,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:24:24,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:24:24,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:24:24,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:24:24,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:24" (1/1) ... [2024-09-12 18:24:24,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:24:24,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:24,198 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:24,204 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:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:24:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 18:24:24,251 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 18:24:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:24:24,251 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:24:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:24:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 18:24:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-12 18:24:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-12 18:24:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2024-09-12 18:24:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2024-09-12 18:24:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 18:24:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 18:24:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:24:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:24:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-12 18:24:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure is_pow2 [2024-09-12 18:24:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure is_pow2 [2024-09-12 18:24:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2024-09-12 18:24:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2024-09-12 18:24:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:24:24,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:24:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 18:24:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 18:24:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-12 18:24:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-12 18:24:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 18:24:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 18:24:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 18:24:24,362 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:24:24,368 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:24:24,769 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-09-12 18:24:24,769 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:24:24,806 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:24:24,808 INFO L318 CfgBuilder]: Removed 7 assume(true) statements. [2024-09-12 18:24:24,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:24:24 BoogieIcfgContainer [2024-09-12 18:24:24,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:24:24,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:24:24,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:24:24,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:24:24,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:24:23" (1/3) ... [2024-09-12 18:24:24,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0a8ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:24:24, skipping insertion in model container [2024-09-12 18:24:24,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:24:24" (2/3) ... [2024-09-12 18:24:24,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0a8ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:24:24, skipping insertion in model container [2024-09-12 18:24:24,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:24:24" (3/3) ... [2024-09-12 18:24:24,819 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2024-09-12 18:24:24,836 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:24:24,836 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-09-12 18:24:24,904 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:24:24,913 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;@7a4760f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:24:24,913 INFO L337 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-09-12 18:24:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 108 states have internal predecessors, (124), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-12 18:24:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 18:24:24,925 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:24,926 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] [2024-09-12 18:24:24,926 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:24,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1158864874, now seen corresponding path program 1 times [2024-09-12 18:24:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:24,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569619930] [2024-09-12 18:24:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:25,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569619930] [2024-09-12 18:24:25,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569619930] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:25,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:25,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:24:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094611957] [2024-09-12 18:24:25,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:25,236 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:24:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:25,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:24:25,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:24:25,270 INFO L87 Difference]: Start difference. First operand has 129 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 108 states have internal predecessors, (124), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 18:24:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:25,454 INFO L93 Difference]: Finished difference Result 273 states and 317 transitions. [2024-09-12 18:24:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:24:25,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 32 [2024-09-12 18:24:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:25,465 INFO L225 Difference]: With dead ends: 273 [2024-09-12 18:24:25,466 INFO L226 Difference]: Without dead ends: 144 [2024-09-12 18:24:25,470 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:25,474 INFO L434 NwaCegarLoop]: 99 mSDtfsCounter, 56 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:25,475 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 174 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-09-12 18:24:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2024-09-12 18:24:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 104 states have internal predecessors, (111), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 18:24:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2024-09-12 18:24:25,547 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 32 [2024-09-12 18:24:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:25,548 INFO L474 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2024-09-12 18:24:25,548 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 18:24:25,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2024-09-12 18:24:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 18:24:25,551 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:25,551 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] [2024-09-12 18:24:25,552 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:24:25,552 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:25,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:25,553 INFO L85 PathProgramCache]: Analyzing trace with hash 288296234, now seen corresponding path program 1 times [2024-09-12 18:24:25,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:25,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435599348] [2024-09-12 18:24:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,800 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435599348] [2024-09-12 18:24:25,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435599348] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:25,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:25,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:24:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467498379] [2024-09-12 18:24:25,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:25,817 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:24:25,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:25,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:24:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:25,819 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:25,999 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2024-09-12 18:24:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:24:26,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 32 [2024-09-12 18:24:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:26,002 INFO L225 Difference]: With dead ends: 149 [2024-09-12 18:24:26,003 INFO L226 Difference]: Without dead ends: 147 [2024-09-12 18:24:26,005 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:26,006 INFO L434 NwaCegarLoop]: 93 mSDtfsCounter, 55 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:26,007 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 344 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-09-12 18:24:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2024-09-12 18:24:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.619718309859155) internal successors, (115), 107 states have internal predecessors, (115), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 18:24:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2024-09-12 18:24:26,033 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 32 [2024-09-12 18:24:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:26,035 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2024-09-12 18:24:26,035 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:26,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2024-09-12 18:24:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-12 18:24:26,037 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:26,037 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] [2024-09-12 18:24:26,037 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 18:24:26,037 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting upsweepErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:26,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1492240399, now seen corresponding path program 1 times [2024-09-12 18:24:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:26,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700745667] [2024-09-12 18:24:26,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,133 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:26,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:26,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700745667] [2024-09-12 18:24:26,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700745667] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:26,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:26,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:24:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247040327] [2024-09-12 18:24:26,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:26,165 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:24:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:24:26,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:24:26,166 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:26,361 INFO L93 Difference]: Finished difference Result 181 states and 203 transitions. [2024-09-12 18:24:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:24:26,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 35 [2024-09-12 18:24:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:26,363 INFO L225 Difference]: With dead ends: 181 [2024-09-12 18:24:26,363 INFO L226 Difference]: Without dead ends: 175 [2024-09-12 18:24:26,364 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:26,365 INFO L434 NwaCegarLoop]: 81 mSDtfsCounter, 98 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:26,365 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 216 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-09-12 18:24:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 141. [2024-09-12 18:24:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.6046511627906976) internal successors, (138), 122 states have internal predecessors, (138), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 18:24:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2024-09-12 18:24:26,378 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 158 transitions. Word has length 35 [2024-09-12 18:24:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:26,378 INFO L474 AbstractCegarLoop]: Abstraction has 141 states and 158 transitions. [2024-09-12 18:24:26,379 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:26,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 158 transitions. [2024-09-12 18:24:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-12 18:24:26,380 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:26,380 INFO L216 NwaCegarLoop]: trace histogram [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:26,381 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:24:26,381 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:26,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1301417980, now seen corresponding path program 1 times [2024-09-12 18:24:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:26,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131461805] [2024-09-12 18:24:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,507 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:26,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:26,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131461805] [2024-09-12 18:24:26,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131461805] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:26,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620905637] [2024-09-12 18:24:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:26,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:26,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:26,555 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:26,557 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:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:26,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:24:26,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:26,716 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:26,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620905637] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:26,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:24:26,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-09-12 18:24:26,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246179334] [2024-09-12 18:24:26,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:26,718 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:24:26,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:26,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:24:26,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:26,719 INFO L87 Difference]: Start difference. First operand 141 states and 158 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:26,786 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2024-09-12 18:24:26,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:24:26,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 35 [2024-09-12 18:24:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:26,791 INFO L225 Difference]: With dead ends: 141 [2024-09-12 18:24:26,791 INFO L226 Difference]: Without dead ends: 140 [2024-09-12 18:24:26,792 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:26,793 INFO L434 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:26,793 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-12 18:24:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-09-12 18:24:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 86 states have (on average 1.5930232558139534) internal successors, (137), 121 states have internal predecessors, (137), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 18:24:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 157 transitions. [2024-09-12 18:24:26,820 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 157 transitions. Word has length 35 [2024-09-12 18:24:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:26,820 INFO L474 AbstractCegarLoop]: Abstraction has 140 states and 157 transitions. [2024-09-12 18:24:26,820 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:26,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 157 transitions. [2024-09-12 18:24:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 18:24:26,824 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:26,824 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] [2024-09-12 18:24:26,842 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 18:24:27,025 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:27,026 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:27,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1689251655, now seen corresponding path program 1 times [2024-09-12 18:24:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:27,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275976291] [2024-09-12 18:24:27,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:27,144 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:27,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:27,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:27,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:27,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:27,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:27,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:27,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275976291] [2024-09-12 18:24:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275976291] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:27,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125393964] [2024-09-12 18:24:27,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:27,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:27,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:27,171 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:27,172 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:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:27,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 18:24:27,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:27,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125393964] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:27,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:27,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-09-12 18:24:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465315867] [2024-09-12 18:24:27,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:27,390 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 18:24:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:27,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 18:24:27,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:24:27,391 INFO L87 Difference]: Start difference. First operand 140 states and 157 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:27,627 INFO L93 Difference]: Finished difference Result 179 states and 208 transitions. [2024-09-12 18:24:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 18:24:27,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 36 [2024-09-12 18:24:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:27,631 INFO L225 Difference]: With dead ends: 179 [2024-09-12 18:24:27,633 INFO L226 Difference]: Without dead ends: 178 [2024-09-12 18:24:27,634 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 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:27,638 INFO L434 NwaCegarLoop]: 92 mSDtfsCounter, 54 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:27,638 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 791 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-09-12 18:24:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 149. [2024-09-12 18:24:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 95 states have (on average 1.568421052631579) internal successors, (149), 130 states have internal predecessors, (149), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 18:24:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2024-09-12 18:24:27,663 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 36 [2024-09-12 18:24:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:27,663 INFO L474 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2024-09-12 18:24:27,663 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:27,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2024-09-12 18:24:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-12 18:24:27,665 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:27,665 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] [2024-09-12 18:24:27,686 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:27,868 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:27,869 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting upsweepErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:27,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1872941261, now seen corresponding path program 1 times [2024-09-12 18:24:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:27,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517925268] [2024-09-12 18:24:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:27,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,025 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:28,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517925268] [2024-09-12 18:24:28,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517925268] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:28,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 18:24:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823980352] [2024-09-12 18:24:28,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:28,068 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 18:24:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:28,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 18:24:28,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:24:28,069 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:28,331 INFO L93 Difference]: Finished difference Result 292 states and 332 transitions. [2024-09-12 18:24:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:24:28,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2024-09-12 18:24:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:28,334 INFO L225 Difference]: With dead ends: 292 [2024-09-12 18:24:28,334 INFO L226 Difference]: Without dead ends: 186 [2024-09-12 18:24:28,335 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-12 18:24:28,336 INFO L434 NwaCegarLoop]: 91 mSDtfsCounter, 61 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:28,338 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 563 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-09-12 18:24:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 154. [2024-09-12 18:24:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 98 states have (on average 1.5510204081632653) internal successors, (152), 134 states have internal predecessors, (152), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:24:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2024-09-12 18:24:28,354 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 38 [2024-09-12 18:24:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:28,354 INFO L474 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2024-09-12 18:24:28,354 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:28,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2024-09-12 18:24:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 18:24:28,360 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:28,360 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:28,360 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 18:24:28,360 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting downsweepErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:28,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash 992202774, now seen corresponding path program 1 times [2024-09-12 18:24:28,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:28,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298952848] [2024-09-12 18:24:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:28,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 18:24:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:28,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:28,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298952848] [2024-09-12 18:24:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298952848] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:28,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:28,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 18:24:28,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689780133] [2024-09-12 18:24:28,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:28,658 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 18:24:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:28,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 18:24:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-12 18:24:28,659 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 18:24:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:29,037 INFO L93 Difference]: Finished difference Result 256 states and 297 transitions. [2024-09-12 18:24:29,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 18:24:29,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 40 [2024-09-12 18:24:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:29,041 INFO L225 Difference]: With dead ends: 256 [2024-09-12 18:24:29,041 INFO L226 Difference]: Without dead ends: 255 [2024-09-12 18:24:29,041 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-09-12 18:24:29,042 INFO L434 NwaCegarLoop]: 88 mSDtfsCounter, 201 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:29,043 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 632 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-09-12 18:24:29,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 207. [2024-09-12 18:24:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 181 states have internal predecessors, (223), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) [2024-09-12 18:24:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 258 transitions. [2024-09-12 18:24:29,071 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 258 transitions. Word has length 40 [2024-09-12 18:24:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:29,071 INFO L474 AbstractCegarLoop]: Abstraction has 207 states and 258 transitions. [2024-09-12 18:24:29,072 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 18:24:29,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 258 transitions. [2024-09-12 18:24:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 18:24:29,074 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:29,074 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, 1] [2024-09-12 18:24:29,075 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 18:24:29,075 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting downsweepErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:29,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash 693515022, now seen corresponding path program 1 times [2024-09-12 18:24:29,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:29,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480782053] [2024-09-12 18:24:29,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,175 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,178 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 18:24:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:29,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480782053] [2024-09-12 18:24:29,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480782053] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:29,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:29,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 18:24:29,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502959789] [2024-09-12 18:24:29,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:29,198 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 18:24:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:29,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 18:24:29,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:24:29,199 INFO L87 Difference]: Start difference. First operand 207 states and 258 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-12 18:24:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:29,431 INFO L93 Difference]: Finished difference Result 307 states and 387 transitions. [2024-09-12 18:24:29,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 18:24:29,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 41 [2024-09-12 18:24:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:29,435 INFO L225 Difference]: With dead ends: 307 [2024-09-12 18:24:29,435 INFO L226 Difference]: Without dead ends: 306 [2024-09-12 18:24:29,435 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-12 18:24:29,436 INFO L434 NwaCegarLoop]: 88 mSDtfsCounter, 138 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:29,436 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 502 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-09-12 18:24:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2024-09-12 18:24:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 191 states have (on average 1.612565445026178) internal successors, (308), 229 states have internal predecessors, (308), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (19), 16 states have call predecessors, (19), 18 states have call successors, (19) [2024-09-12 18:24:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 347 transitions. [2024-09-12 18:24:29,471 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 347 transitions. Word has length 41 [2024-09-12 18:24:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:29,472 INFO L474 AbstractCegarLoop]: Abstraction has 259 states and 347 transitions. [2024-09-12 18:24:29,472 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-12 18:24:29,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 347 transitions. [2024-09-12 18:24:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 18:24:29,473 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:29,473 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, 1] [2024-09-12 18:24:29,473 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 18:24:29,474 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting downsweepErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:29,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2118699530, now seen corresponding path program 1 times [2024-09-12 18:24:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:29,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835968996] [2024-09-12 18:24:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:29,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 18:24:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 18:24:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 18:24:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 18:24:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835968996] [2024-09-12 18:24:29,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835968996] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211056746] [2024-09-12 18:24:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:29,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:29,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:29,947 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:29,949 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:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:30,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 18:24:30,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:24:30,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:24:30,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211056746] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:30,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 16 [2024-09-12 18:24:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725817760] [2024-09-12 18:24:30,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:30,238 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 18:24:30,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:30,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 18:24:30,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-09-12 18:24:30,239 INFO L87 Difference]: Start difference. First operand 259 states and 347 transitions. Second operand has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-09-12 18:24:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:30,779 INFO L93 Difference]: Finished difference Result 290 states and 387 transitions. [2024-09-12 18:24:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 18:24:30,779 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 41 [2024-09-12 18:24:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:30,781 INFO L225 Difference]: With dead ends: 290 [2024-09-12 18:24:30,782 INFO L226 Difference]: Without dead ends: 289 [2024-09-12 18:24:30,784 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2024-09-12 18:24:30,785 INFO L434 NwaCegarLoop]: 85 mSDtfsCounter, 201 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:30,785 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 865 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:24:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-09-12 18:24:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 179. [2024-09-12 18:24:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 122 states have (on average 1.5819672131147542) internal successors, (193), 157 states have internal predecessors, (193), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-12 18:24:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 217 transitions. [2024-09-12 18:24:30,818 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 217 transitions. Word has length 41 [2024-09-12 18:24:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:30,818 INFO L474 AbstractCegarLoop]: Abstraction has 179 states and 217 transitions. [2024-09-12 18:24:30,818 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-09-12 18:24:30,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:30,819 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 217 transitions. [2024-09-12 18:24:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-12 18:24:30,820 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:30,820 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, 1, 1] [2024-09-12 18:24:30,837 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 18:24:31,020 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:31,021 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting downsweepErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:31,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 24129304, now seen corresponding path program 1 times [2024-09-12 18:24:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:31,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249602358] [2024-09-12 18:24:31,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:31,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 18:24:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:31,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249602358] [2024-09-12 18:24:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249602358] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:31,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 18:24:31,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008661244] [2024-09-12 18:24:31,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:31,170 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 18:24:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:31,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 18:24:31,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:31,171 INFO L87 Difference]: Start difference. First operand 179 states and 217 transitions. Second operand has 9 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:24:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:31,550 INFO L93 Difference]: Finished difference Result 258 states and 301 transitions. [2024-09-12 18:24:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 18:24:31,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 42 [2024-09-12 18:24:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:31,553 INFO L225 Difference]: With dead ends: 258 [2024-09-12 18:24:31,553 INFO L226 Difference]: Without dead ends: 256 [2024-09-12 18:24:31,554 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-09-12 18:24:31,554 INFO L434 NwaCegarLoop]: 74 mSDtfsCounter, 142 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:31,555 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 536 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:24:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-09-12 18:24:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 207. [2024-09-12 18:24:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 147 states have (on average 1.5850340136054422) internal successors, (233), 183 states have internal predecessors, (233), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2024-09-12 18:24:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 260 transitions. [2024-09-12 18:24:31,589 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 260 transitions. Word has length 42 [2024-09-12 18:24:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:31,589 INFO L474 AbstractCegarLoop]: Abstraction has 207 states and 260 transitions. [2024-09-12 18:24:31,589 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:24:31,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 260 transitions. [2024-09-12 18:24:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 18:24:31,590 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:31,590 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, 1] [2024-09-12 18:24:31,591 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 18:24:31,591 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting upsweepErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:31,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash -155277273, now seen corresponding path program 1 times [2024-09-12 18:24:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:31,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658584568] [2024-09-12 18:24:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:31,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:31,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658584568] [2024-09-12 18:24:31,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658584568] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:31,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887343647] [2024-09-12 18:24:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:31,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:31,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:31,710 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:31,712 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:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:31,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 18:24:31,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:31,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:31,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887343647] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:31,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:31,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2024-09-12 18:24:31,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22342176] [2024-09-12 18:24:31,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:31,918 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 18:24:31,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:31,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 18:24:31,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:24:31,920 INFO L87 Difference]: Start difference. First operand 207 states and 260 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:32,226 INFO L93 Difference]: Finished difference Result 349 states and 422 transitions. [2024-09-12 18:24:32,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 18:24:32,227 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2024-09-12 18:24:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:32,229 INFO L225 Difference]: With dead ends: 349 [2024-09-12 18:24:32,229 INFO L226 Difference]: Without dead ends: 244 [2024-09-12 18:24:32,229 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-09-12 18:24:32,230 INFO L434 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:32,232 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 717 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-09-12 18:24:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 212. [2024-09-12 18:24:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 150 states have (on average 1.5733333333333333) internal successors, (236), 187 states have internal predecessors, (236), 15 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (14), 11 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-12 18:24:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 265 transitions. [2024-09-12 18:24:32,265 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 265 transitions. Word has length 41 [2024-09-12 18:24:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:32,265 INFO L474 AbstractCegarLoop]: Abstraction has 212 states and 265 transitions. [2024-09-12 18:24:32,265 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:32,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 265 transitions. [2024-09-12 18:24:32,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 18:24:32,266 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:32,266 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, 1, 1, 1, 1] [2024-09-12 18:24:32,285 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:32,470 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:32,471 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting downsweepErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:32,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:32,471 INFO L85 PathProgramCache]: Analyzing trace with hash -364911244, now seen corresponding path program 1 times [2024-09-12 18:24:32,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:32,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724117475] [2024-09-12 18:24:32,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:32,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:32,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:32,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:32,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:32,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:32,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:32,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:32,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-12 18:24:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:32,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:32,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724117475] [2024-09-12 18:24:32,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724117475] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:32,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990011595] [2024-09-12 18:24:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:32,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:32,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:32,617 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:32,619 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:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:32,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:24:32,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 18:24:32,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:24:32,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990011595] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:32,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:24:32,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-09-12 18:24:32,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816716238] [2024-09-12 18:24:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:32,768 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:24:32,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:32,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:24:32,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-09-12 18:24:32,769 INFO L87 Difference]: Start difference. First operand 212 states and 265 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-12 18:24:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:32,848 INFO L93 Difference]: Finished difference Result 212 states and 265 transitions. [2024-09-12 18:24:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:24:32,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2024-09-12 18:24:32,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:32,851 INFO L225 Difference]: With dead ends: 212 [2024-09-12 18:24:32,851 INFO L226 Difference]: Without dead ends: 211 [2024-09-12 18:24:32,852 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:24:32,853 INFO L434 NwaCegarLoop]: 113 mSDtfsCounter, 81 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:32,853 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 366 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:24:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-09-12 18:24:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2024-09-12 18:24:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 123 states have (on average 1.5528455284552845) internal successors, (191), 158 states have internal predecessors, (191), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-12 18:24:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2024-09-12 18:24:32,884 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 44 [2024-09-12 18:24:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:32,884 INFO L474 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2024-09-12 18:24:32,885 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-12 18:24:32,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2024-09-12 18:24:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-12 18:24:32,885 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:32,886 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, 1, 1, 1, 1, 1] [2024-09-12 18:24:32,904 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 18:24:33,086 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-12 18:24:33,087 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting downsweepErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:33,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1576660562, now seen corresponding path program 1 times [2024-09-12 18:24:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:33,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446855152] [2024-09-12 18:24:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:33,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,127 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,133 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 18:24:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:33,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:33,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446855152] [2024-09-12 18:24:33,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446855152] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:33,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:33,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:24:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627650542] [2024-09-12 18:24:33,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:33,146 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:24:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:24:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:24:33,147 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:24:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:33,302 INFO L93 Difference]: Finished difference Result 209 states and 252 transitions. [2024-09-12 18:24:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:24:33,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2024-09-12 18:24:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:33,305 INFO L225 Difference]: With dead ends: 209 [2024-09-12 18:24:33,306 INFO L226 Difference]: Without dead ends: 205 [2024-09-12 18:24:33,306 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:33,307 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 70 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:33,307 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 172 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-09-12 18:24:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 176. [2024-09-12 18:24:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 154 states have internal predecessors, (183), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-12 18:24:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 208 transitions. [2024-09-12 18:24:33,335 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 208 transitions. Word has length 45 [2024-09-12 18:24:33,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:33,335 INFO L474 AbstractCegarLoop]: Abstraction has 176 states and 208 transitions. [2024-09-12 18:24:33,336 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:24:33,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:33,336 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 208 transitions. [2024-09-12 18:24:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 18:24:33,336 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:33,336 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:33,337 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 18:24:33,337 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting upsweepErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:33,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:33,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1213703539, now seen corresponding path program 2 times [2024-09-12 18:24:33,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:33,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874514125] [2024-09-12 18:24:33,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:33,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-12 18:24:33,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874514125] [2024-09-12 18:24:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874514125] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:33,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:24:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600608474] [2024-09-12 18:24:33,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:33,420 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:24:33,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:33,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:24:33,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:33,421 INFO L87 Difference]: Start difference. First operand 176 states and 208 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:33,615 INFO L93 Difference]: Finished difference Result 211 states and 244 transitions. [2024-09-12 18:24:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:24:33,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2024-09-12 18:24:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:33,617 INFO L225 Difference]: With dead ends: 211 [2024-09-12 18:24:33,617 INFO L226 Difference]: Without dead ends: 209 [2024-09-12 18:24:33,618 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:24:33,618 INFO L434 NwaCegarLoop]: 74 mSDtfsCounter, 90 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:33,619 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 260 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-09-12 18:24:33,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 176. [2024-09-12 18:24:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 123 states have (on average 1.4715447154471544) internal successors, (181), 154 states have internal predecessors, (181), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-12 18:24:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 206 transitions. [2024-09-12 18:24:33,647 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 206 transitions. Word has length 44 [2024-09-12 18:24:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:33,647 INFO L474 AbstractCegarLoop]: Abstraction has 176 states and 206 transitions. [2024-09-12 18:24:33,647 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:33,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 206 transitions. [2024-09-12 18:24:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-12 18:24:33,648 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:33,648 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, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:33,649 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 18:24:33,650 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting downsweepErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:33,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1631837282, now seen corresponding path program 1 times [2024-09-12 18:24:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:33,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011855439] [2024-09-12 18:24:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 18:24:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:33,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:33,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011855439] [2024-09-12 18:24:33,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011855439] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:33,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:33,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 18:24:33,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825106227] [2024-09-12 18:24:33,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:33,856 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 18:24:33,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:33,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 18:24:33,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-09-12 18:24:33,857 INFO L87 Difference]: Start difference. First operand 176 states and 206 transitions. Second operand has 10 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:24:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:34,227 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2024-09-12 18:24:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 18:24:34,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 46 [2024-09-12 18:24:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:34,229 INFO L225 Difference]: With dead ends: 242 [2024-09-12 18:24:34,229 INFO L226 Difference]: Without dead ends: 194 [2024-09-12 18:24:34,230 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-09-12 18:24:34,230 INFO L434 NwaCegarLoop]: 70 mSDtfsCounter, 104 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:34,230 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 555 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:24:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-09-12 18:24:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 160. [2024-09-12 18:24:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 138 states have internal predecessors, (153), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-12 18:24:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 178 transitions. [2024-09-12 18:24:34,255 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 178 transitions. Word has length 46 [2024-09-12 18:24:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:34,255 INFO L474 AbstractCegarLoop]: Abstraction has 160 states and 178 transitions. [2024-09-12 18:24:34,255 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:24:34,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 178 transitions. [2024-09-12 18:24:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-12 18:24:34,256 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:34,256 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:24:34,256 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-12 18:24:34,256 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting upsweepErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:34,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1029896156, now seen corresponding path program 1 times [2024-09-12 18:24:34,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:34,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091943432] [2024-09-12 18:24:34,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:34,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-12 18:24:34,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:34,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091943432] [2024-09-12 18:24:34,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091943432] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:34,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:34,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:24:34,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954159718] [2024-09-12 18:24:34,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:34,325 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:24:34,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:34,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:24:34,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:24:34,326 INFO L87 Difference]: Start difference. First operand 160 states and 178 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:34,521 INFO L93 Difference]: Finished difference Result 199 states and 218 transitions. [2024-09-12 18:24:34,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:24:34,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-09-12 18:24:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:34,523 INFO L225 Difference]: With dead ends: 199 [2024-09-12 18:24:34,523 INFO L226 Difference]: Without dead ends: 197 [2024-09-12 18:24:34,523 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:24:34,524 INFO L434 NwaCegarLoop]: 76 mSDtfsCounter, 94 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:34,524 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 269 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-09-12 18:24:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 169. [2024-09-12 18:24:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 116 states have (on average 1.4224137931034482) internal successors, (165), 147 states have internal predecessors, (165), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-12 18:24:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2024-09-12 18:24:34,545 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 45 [2024-09-12 18:24:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:34,545 INFO L474 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2024-09-12 18:24:34,546 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:34,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2024-09-12 18:24:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-12 18:24:34,547 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:34,547 INFO L216 NwaCegarLoop]: trace histogram [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:24:34,547 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-12 18:24:34,547 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting upsweepErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:34,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:34,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1862009967, now seen corresponding path program 1 times [2024-09-12 18:24:34,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:34,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234874085] [2024-09-12 18:24:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,822 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,826 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234874085] [2024-09-12 18:24:34,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234874085] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259367090] [2024-09-12 18:24:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:34,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:34,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:34,881 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:34,883 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:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:34,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-12 18:24:34,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:34,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-09-12 18:24:35,037 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:35,096 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-12 18:24:35,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-09-12 18:24:35,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-09-12 18:24:35,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-09-12 18:24:35,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-09-12 18:24:35,164 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:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 18:24:35,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:35,404 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (upsweep_~a.offset Int) (upsweep_~left~0 Int) (v_upsweep_~right~0_4 Int)) (< 0 (let ((.cse0 (select (store |c_#memory_int#1| |c_main_#t~malloc16.base| v_ArrVal_227) c_main_~a~0.base))) (+ 2147483649 (select .cse0 (+ (* upsweep_~left~0 4) upsweep_~a.offset)) (select .cse0 (+ (* v_upsweep_~right~0_4 4) upsweep_~a.offset)))))) is different from false [2024-09-12 18:24:35,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259367090] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:35,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:24:35,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 15 [2024-09-12 18:24:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446905660] [2024-09-12 18:24:35,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:35,432 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 18:24:35,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:35,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 18:24:35,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=363, Unknown=3, NotChecked=38, Total=462 [2024-09-12 18:24:35,433 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand has 16 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 18:24:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:35,959 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2024-09-12 18:24:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 18:24:35,960 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-09-12 18:24:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:35,961 INFO L225 Difference]: With dead ends: 169 [2024-09-12 18:24:35,961 INFO L226 Difference]: Without dead ends: 167 [2024-09-12 18:24:35,962 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=690, Unknown=3, NotChecked=54, Total=870 [2024-09-12 18:24:35,962 INFO L434 NwaCegarLoop]: 78 mSDtfsCounter, 213 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:35,962 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 650 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:24:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-09-12 18:24:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-09-12 18:24:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 145 states have internal predecessors, (159), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-12 18:24:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2024-09-12 18:24:35,992 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 46 [2024-09-12 18:24:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:35,992 INFO L474 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2024-09-12 18:24:35,992 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 18:24:35,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2024-09-12 18:24:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-12 18:24:35,993 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:35,993 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 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:36,011 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:36,197 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-12 18:24:36,198 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:36,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1560697645, now seen corresponding path program 2 times [2024-09-12 18:24:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:36,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194923137] [2024-09-12 18:24:36,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:36,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:36,344 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:36,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:36,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:36,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:36,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:36,367 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:36,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:36,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194923137] [2024-09-12 18:24:36,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194923137] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:36,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054017949] [2024-09-12 18:24:36,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:24:36,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:36,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:36,373 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:36,375 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:36,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 18:24:36,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:24:36,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:24:36,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 18:24:36,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 18:24:36,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054017949] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:36,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:36,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 3, 3] total 14 [2024-09-12 18:24:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515630794] [2024-09-12 18:24:36,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:36,570 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-12 18:24:36,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:36,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-12 18:24:36,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-09-12 18:24:36,571 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-12 18:24:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:36,896 INFO L93 Difference]: Finished difference Result 192 states and 213 transitions. [2024-09-12 18:24:36,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 18:24:36,896 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 45 [2024-09-12 18:24:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:36,898 INFO L225 Difference]: With dead ends: 192 [2024-09-12 18:24:36,898 INFO L226 Difference]: Without dead ends: 191 [2024-09-12 18:24:36,898 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2024-09-12 18:24:36,898 INFO L434 NwaCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:36,899 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 612 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:24:36,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-09-12 18:24:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 158. [2024-09-12 18:24:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 136 states have internal predecessors, (148), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-12 18:24:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2024-09-12 18:24:36,926 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 45 [2024-09-12 18:24:36,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:36,926 INFO L474 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2024-09-12 18:24:36,926 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-12 18:24:36,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2024-09-12 18:24:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-12 18:24:36,927 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:36,927 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:36,946 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:37,128 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-12 18:24:37,128 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting upsweepErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:37,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:37,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1649828891, now seen corresponding path program 1 times [2024-09-12 18:24:37,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:37,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829053577] [2024-09-12 18:24:37,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:37,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:37,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:37,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:37,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:37,175 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:37,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:37,182 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-12 18:24:37,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:37,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829053577] [2024-09-12 18:24:37,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829053577] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:37,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092901084] [2024-09-12 18:24:37,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:37,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:37,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:37,185 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:37,188 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:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:37,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 18:24:37,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:37,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:37,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092901084] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:37,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:37,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 18 [2024-09-12 18:24:37,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379378785] [2024-09-12 18:24:37,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:37,475 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 18:24:37,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:37,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 18:24:37,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-09-12 18:24:37,476 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:38,300 INFO L93 Difference]: Finished difference Result 263 states and 288 transitions. [2024-09-12 18:24:38,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 18:24:38,301 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2024-09-12 18:24:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:38,302 INFO L225 Difference]: With dead ends: 263 [2024-09-12 18:24:38,302 INFO L226 Difference]: Without dead ends: 164 [2024-09-12 18:24:38,303 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2024-09-12 18:24:38,304 INFO L434 NwaCegarLoop]: 71 mSDtfsCounter, 252 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:38,304 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 979 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 18:24:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-09-12 18:24:38,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2024-09-12 18:24:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 132 states have internal predecessors, (143), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-12 18:24:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2024-09-12 18:24:38,334 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 48 [2024-09-12 18:24:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:38,334 INFO L474 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2024-09-12 18:24:38,334 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:38,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2024-09-12 18:24:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-12 18:24:38,335 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:38,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:38,352 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-12 18:24:38,535 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:38,536 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:38,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2140185265, now seen corresponding path program 1 times [2024-09-12 18:24:38,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:38,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189766960] [2024-09-12 18:24:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:38,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 18:24:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 18:24:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:38,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189766960] [2024-09-12 18:24:38,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189766960] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:24:38,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:24:38,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 18:24:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403870028] [2024-09-12 18:24:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:24:38,647 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 18:24:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 18:24:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:24:38,648 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-12 18:24:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:38,847 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2024-09-12 18:24:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:24:38,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2024-09-12 18:24:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:38,851 INFO L225 Difference]: With dead ends: 177 [2024-09-12 18:24:38,851 INFO L226 Difference]: Without dead ends: 154 [2024-09-12 18:24:38,852 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:24:38,852 INFO L434 NwaCegarLoop]: 82 mSDtfsCounter, 42 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:38,853 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 462 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:24:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-09-12 18:24:38,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-09-12 18:24:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 108 states have (on average 1.3148148148148149) internal successors, (142), 132 states have internal predecessors, (142), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-12 18:24:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2024-09-12 18:24:38,891 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 53 [2024-09-12 18:24:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:38,894 INFO L474 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2024-09-12 18:24:38,894 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-12 18:24:38,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2024-09-12 18:24:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-12 18:24:38,896 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:38,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:38,897 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-12 18:24:38,897 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:38,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1303637015, now seen corresponding path program 1 times [2024-09-12 18:24:38,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:38,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273728581] [2024-09-12 18:24:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:39,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:39,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:39,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:39,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:39,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:39,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:39,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-12 18:24:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:39,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 18:24:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:39,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:39,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273728581] [2024-09-12 18:24:39,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273728581] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:39,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575677657] [2024-09-12 18:24:39,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:39,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:39,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:39,354 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:39,357 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:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:39,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-09-12 18:24:39,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:39,691 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 16 treesize of output 12 [2024-09-12 18:24:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 18:24:39,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:39,952 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 13 [2024-09-12 18:24:39,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 12 [2024-09-12 18:24:40,015 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 37 treesize of output 33 [2024-09-12 18:24:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575677657] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:40,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:40,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 14] total 36 [2024-09-12 18:24:40,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195552267] [2024-09-12 18:24:40,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:40,187 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-12 18:24:40,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:40,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-12 18:24:40,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1172, Unknown=0, NotChecked=0, Total=1260 [2024-09-12 18:24:40,189 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 36 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 30 states have internal predecessors, (74), 9 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2024-09-12 18:24:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:41,586 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2024-09-12 18:24:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-12 18:24:41,587 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 30 states have internal predecessors, (74), 9 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 56 [2024-09-12 18:24:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:41,589 INFO L225 Difference]: With dead ends: 200 [2024-09-12 18:24:41,589 INFO L226 Difference]: Without dead ends: 198 [2024-09-12 18:24:41,590 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=3054, Unknown=0, NotChecked=0, Total=3306 [2024-09-12 18:24:41,590 INFO L434 NwaCegarLoop]: 67 mSDtfsCounter, 224 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:41,591 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1900 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-12 18:24:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-09-12 18:24:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 162. [2024-09-12 18:24:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 137 states have internal predecessors, (147), 15 states have call successors, (15), 13 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 18:24:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2024-09-12 18:24:41,624 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 56 [2024-09-12 18:24:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:41,625 INFO L474 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2024-09-12 18:24:41,625 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 30 states have internal predecessors, (74), 9 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2024-09-12 18:24:41,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2024-09-12 18:24:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 18:24:41,627 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:41,627 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:41,644 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:41,831 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-09-12 18:24:41,832 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting upsweepErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:41,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1954874917, now seen corresponding path program 1 times [2024-09-12 18:24:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:41,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474361212] [2024-09-12 18:24:41,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:41,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:41,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:41,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:41,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:41,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:42,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:42,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 18:24:42,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:42,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474361212] [2024-09-12 18:24:42,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474361212] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:42,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908791077] [2024-09-12 18:24:42,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:42,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:42,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:42,013 INFO L229 MonitoredProcess]: Starting monitored process 11 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:42,015 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-12 18:24:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:42,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 18:24:42,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:42,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:24:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908791077] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:42,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:24:42,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 20 [2024-09-12 18:24:42,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38243623] [2024-09-12 18:24:42,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:42,364 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 18:24:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:42,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 18:24:42,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-09-12 18:24:42,365 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:42,850 INFO L93 Difference]: Finished difference Result 298 states and 329 transitions. [2024-09-12 18:24:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-12 18:24:42,850 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 54 [2024-09-12 18:24:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:42,852 INFO L225 Difference]: With dead ends: 298 [2024-09-12 18:24:42,852 INFO L226 Difference]: Without dead ends: 204 [2024-09-12 18:24:42,853 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2024-09-12 18:24:42,853 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 90 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:42,853 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 664 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:24:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-09-12 18:24:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 186. [2024-09-12 18:24:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 135 states have (on average 1.2666666666666666) internal successors, (171), 160 states have internal predecessors, (171), 16 states have call successors, (16), 14 states have call predecessors, (16), 11 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-12 18:24:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 200 transitions. [2024-09-12 18:24:42,891 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 200 transitions. Word has length 54 [2024-09-12 18:24:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:42,891 INFO L474 AbstractCegarLoop]: Abstraction has 186 states and 200 transitions. [2024-09-12 18:24:42,891 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:24:42,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 200 transitions. [2024-09-12 18:24:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-12 18:24:42,892 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:42,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:42,910 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-12 18:24:43,096 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-09-12 18:24:43,097 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:24:43,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1560089135, now seen corresponding path program 1 times [2024-09-12 18:24:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:43,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871232797] [2024-09-12 18:24:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:24:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:24:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:24:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:24:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:24:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:24:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-12 18:24:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 18:24:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 18:24:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 18:24:43,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871232797] [2024-09-12 18:24:43,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871232797] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:24:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372567925] [2024-09-12 18:24:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:43,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:43,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:43,662 INFO L229 MonitoredProcess]: Starting monitored process 12 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:43,671 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-12 18:24:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:24:43,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-12 18:24:43,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:43,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-09-12 18:24:43,816 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:43,862 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-12 18:24:43,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-09-12 18:24:43,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-09-12 18:24:43,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-09-12 18:24:43,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2024-09-12 18:24:48,098 WARN L854 $PredicateComparison]: unable to prove that (and (not (= c_main_~a0~0.base c_main_~a~0.base)) (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= .cse0 (select |c_#memory_int#1| c_main_~a~0.base)) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| c_main_~a0~0.base) c_main_~a0~0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse1 c_main_~a~0.base) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| c_main_~a~0.base)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_main_~a0~0.base) c_main_~a0~0.offset)))))))) is different from false [2024-09-12 18:24:48,100 WARN L876 $PredicateComparison]: unable to prove that (and (not (= c_main_~a0~0.base c_main_~a~0.base)) (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= .cse0 (select |c_#memory_int#1| c_main_~a~0.base)) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| c_main_~a0~0.base) c_main_~a0~0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse1 c_main_~a~0.base) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| c_main_~a~0.base)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_main_~a0~0.base) c_main_~a0~0.offset)))))))) is different from true [2024-09-12 18:24:52,125 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| |c_check_#in~a0.base|) |c_check_#in~a0.offset|))) (= .cse0 (select |c_#memory_int#1| |c_check_#in~a.base|))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| |c_check_#in~a0.base|) |c_check_#in~a0.offset|)) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| |c_check_#in~a.base|)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 |c_check_#in~a.base|)))))) (not (= |c_check_#in~a0.base| |c_check_#in~a.base|))) is different from false [2024-09-12 18:24:52,130 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| |c_check_#in~a0.base|) |c_check_#in~a0.offset|))) (= .cse0 (select |c_#memory_int#1| |c_check_#in~a.base|))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| |c_check_#in~a0.base|) |c_check_#in~a0.offset|)) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| |c_check_#in~a.base|)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 |c_check_#in~a.base|)))))) (not (= |c_check_#in~a0.base| |c_check_#in~a.base|))) is different from true [2024-09-12 18:24:56,161 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| c_check_~a0.base) c_check_~a0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (not (= c_check_~a0.base .cse1)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_check_~a0.base) c_check_~a0.offset))))))) (<= 0 c_check_~sum~0) (= c_check_~i~0 0)) is different from false [2024-09-12 18:24:56,171 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| c_check_~a0.base) c_check_~a0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (not (= c_check_~a0.base .cse1)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_check_~a0.base) c_check_~a0.offset))))))) (<= 0 c_check_~sum~0) (= c_check_~i~0 0)) is different from true [2024-09-12 18:25:00,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (not (= v_check_~a0.base_BEFORE_CALL_1 .cse1))))) (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_1)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1))))))) is different from false [2024-09-12 18:25:04,271 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (not (= v_check_~a0.base_BEFORE_CALL_1 .cse1))))) (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_1)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1))))))) is different from true [2024-09-12 18:25:08,446 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (or (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (not (= v_check_~a0.base_BEFORE_CALL_1 .cse1))))) (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_1)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))))) (or (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| c_check_~a0.base) c_check_~a0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse2)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse2 (select |c_#memory_int#1| .cse2))) (not (= c_check_~a0.base .cse2)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_check_~a0.base) c_check_~a0.offset)))))) (<= 0 c_check_~sum~0) (= c_check_~i~0 0))) is different from false [2024-09-12 18:25:08,450 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (or (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (not (= v_check_~a0.base_BEFORE_CALL_1 .cse1))))) (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_1)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))))) (or (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| c_check_~a0.base) c_check_~a0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse2)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse2 (select |c_#memory_int#1| .cse2))) (not (= c_check_~a0.base .cse2)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_check_~a0.base) c_check_~a0.offset)))))) (<= 0 c_check_~sum~0) (= c_check_~i~0 0))) is different from true [2024-09-12 18:25:08,572 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-09-12 18:25:08,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 54 [2024-09-12 18:25:08,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 18:25:08,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 24 [2024-09-12 18:25:08,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 10 [2024-09-12 18:25:12,925 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((v_main_~a~0.offset_16 Int)) (<= (select .cse0 v_main_~a~0.offset_16) |c_check_#t~mem11|)) (exists ((check_~a0.offset Int)) (<= (select .cse0 check_~a0.offset) |c_check_#t~mem11|)) (exists ((check_~a.base Int) (v_check_~a0.base_BEFORE_CALL_1 Int)) (and (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_1)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (= .cse0 (select |#memory_int#1| check_~a.base)) (<= (select .cse0 main_~a~0.offset) (select (select |#memory_int#1| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (<= (select (select |#memory_int#1| check_~a0.base) check_~a0.offset) |c_check_#t~mem11|) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| check_~a0.base) check_~a0.offset)) (not (= .cse1 check_~a0.base)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |#memory_int#1| .cse1)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1))))))))))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (v_check_~a0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (exists ((check_~a0.base Int) (check_~a0.offset Int)) (let ((.cse2 (select (select |#memory_int#1| check_~a0.base) check_~a0.offset))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base check_~a0.base)) (= .cse0 (select |#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) .cse2)) (<= .cse2 |c_check_#t~mem11|)))) (not (= v_check_~a0.base_BEFORE_CALL_1 .cse3)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse3 (select |#memory_int#1| .cse3)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse3))))) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (v_check_~a0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_1 .cse4)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse4 (select |#memory_int#1| .cse4)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse4)) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (<= (select (select |#memory_int#1| check_~a0.base) check_~a0.offset) |c_check_#t~mem11|) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| check_~a0.base) check_~a0.offset)) (not (= .cse5 check_~a0.base)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse5 (select |#memory_int#1| .cse5)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse5)))))))))) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))))) (<= 0 c_check_~sum~0)) is different from false [2024-09-12 18:25:12,932 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((v_main_~a~0.offset_16 Int)) (<= (select .cse0 v_main_~a~0.offset_16) |c_check_#t~mem11|)) (exists ((check_~a0.offset Int)) (<= (select .cse0 check_~a0.offset) |c_check_#t~mem11|)) (exists ((check_~a.base Int) (v_check_~a0.base_BEFORE_CALL_1 Int)) (and (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_1)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (= .cse0 (select |#memory_int#1| check_~a.base)) (<= (select .cse0 main_~a~0.offset) (select (select |#memory_int#1| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (<= (select (select |#memory_int#1| check_~a0.base) check_~a0.offset) |c_check_#t~mem11|) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| check_~a0.base) check_~a0.offset)) (not (= .cse1 check_~a0.base)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |#memory_int#1| .cse1)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1))))))))))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (v_check_~a0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (exists ((check_~a0.base Int) (check_~a0.offset Int)) (let ((.cse2 (select (select |#memory_int#1| check_~a0.base) check_~a0.offset))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base check_~a0.base)) (= .cse0 (select |#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) .cse2)) (<= .cse2 |c_check_#t~mem11|)))) (not (= v_check_~a0.base_BEFORE_CALL_1 .cse3)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse3 (select |#memory_int#1| .cse3)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse3))))) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (v_check_~a0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_1 .cse4)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse4 (select |#memory_int#1| .cse4)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse4)) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (<= (select (select |#memory_int#1| check_~a0.base) check_~a0.offset) |c_check_#t~mem11|) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| check_~a0.base) check_~a0.offset)) (not (= .cse5 check_~a0.base)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse5 (select |#memory_int#1| .cse5)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse5)))))))))) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))))) (<= 0 c_check_~sum~0)) is different from true [2024-09-12 18:25:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:25:12,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:25:13,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372567925] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:25:13,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:25:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 26 [2024-09-12 18:25:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621770655] [2024-09-12 18:25:13,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:25:13,174 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-12 18:25:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:25:13,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-12 18:25:13,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=570, Unknown=23, NotChecked=318, Total=992 [2024-09-12 18:25:13,176 INFO L87 Difference]: Start difference. First operand 186 states and 200 transitions. Second operand has 27 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 10 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2024-09-12 18:25:17,849 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| c_main_~a0~0.base))) (and (not (= c_main_~a0~0.base c_main_~a~0.base)) (= 0 c_main_~a0~0.offset) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= 1 (select |c_#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|))) (= (select .cse0 0) 0) (let ((.cse1 ((as const (Array Int Int)) 0))) (or (and (= .cse1 (select |c_#memory_int#1| c_main_~a~0.base)) (exists ((main_~a~0.offset Int)) (<= (select .cse1 main_~a~0.offset) (select .cse0 c_main_~a0~0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse2 c_main_~a~0.base) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_40| c_main_~a~0.base)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse2 (select |c_#memory_int#1| .cse2))) (<= (select .cse1 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_main_~a0~0.base) c_main_~a0~0.offset))))))))) is different from false [2024-09-12 18:25:17,852 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| c_main_~a0~0.base))) (and (not (= c_main_~a0~0.base c_main_~a~0.base)) (= 0 c_main_~a0~0.offset) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= 1 (select |c_#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|))) (= (select .cse0 0) 0) (let ((.cse1 ((as const (Array Int Int)) 0))) (or (and (= .cse1 (select |c_#memory_int#1| c_main_~a~0.base)) (exists ((main_~a~0.offset Int)) (<= (select .cse1 main_~a~0.offset) (select .cse0 c_main_~a0~0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse2 c_main_~a~0.base) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_40| c_main_~a~0.base)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse2 (select |c_#memory_int#1| .cse2))) (<= (select .cse1 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_main_~a0~0.base) c_main_~a0~0.offset))))))))) is different from true [2024-09-12 18:25:21,856 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_check_#in~a0.base|))) (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select .cse1 |c_check_#in~a0.offset|))) (= .cse0 (select |c_#memory_int#1| |c_check_#in~a.base|))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| |c_check_#in~a0.base|) |c_check_#in~a0.offset|)) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| |c_check_#in~a.base|)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse2 |c_check_#in~a.base|)))))) (= (select .cse1 0) 0) (= |c_check_#in~a0.offset| 0) (not (= |c_check_#in~a0.base| |c_check_#in~a.base|)))) is different from false [2024-09-12 18:25:21,860 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_check_#in~a0.base|))) (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select .cse1 |c_check_#in~a0.offset|))) (= .cse0 (select |c_#memory_int#1| |c_check_#in~a.base|))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| |c_check_#in~a0.base|) |c_check_#in~a0.offset|)) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| |c_check_#in~a.base|)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse2 |c_check_#in~a.base|)))))) (= (select .cse1 0) 0) (= |c_check_#in~a0.offset| 0) (not (= |c_check_#in~a0.base| |c_check_#in~a.base|)))) is different from true [2024-09-12 18:25:25,865 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| c_check_~a0.base))) (and (= c_check_~sum~0 0) (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select .cse1 c_check_~a0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse2)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse2 (select |c_#memory_int#1| .cse2))) (not (= c_check_~a0.base .cse2)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_check_~a0.base) c_check_~a0.offset))))))) (<= 0 c_check_~sum~0) (= c_check_~i~0 0) (= (select .cse1 (+ c_check_~a0.offset (* c_check_~i~0 4))) 0))) is different from false [2024-09-12 18:25:25,869 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| c_check_~a0.base))) (and (= c_check_~sum~0 0) (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select .cse1 c_check_~a0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse2)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse2 (select |c_#memory_int#1| .cse2))) (not (= c_check_~a0.base .cse2)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_check_~a0.base) c_check_~a0.offset))))))) (<= 0 c_check_~sum~0) (= c_check_~i~0 0) (= (select .cse1 (+ c_check_~a0.offset (* c_check_~i~0 4))) 0))) is different from true [2024-09-12 18:25:29,880 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int#1| c_check_~a0.base))) (and (= c_check_~sum~0 0) (or (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (not (= v_check_~a0.base_BEFORE_CALL_1 .cse1))))) (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_1)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))))) (or (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select .cse2 c_check_~a0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse3)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse3 (select |c_#memory_int#1| .cse3))) (not (= c_check_~a0.base .cse3)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_check_~a0.base) c_check_~a0.offset)))))) (<= 0 c_check_~sum~0) (= c_check_~i~0 0) (= (select .cse2 (+ c_check_~a0.offset (* c_check_~i~0 4))) 0))) is different from false [2024-09-12 18:25:29,885 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int#1| c_check_~a0.base))) (and (= c_check_~sum~0 0) (or (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |c_#memory_int#1| .cse1))) (not (= v_check_~a0.base_BEFORE_CALL_1 .cse1))))) (exists ((v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_1)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))))) (or (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) (select .cse2 c_check_~a0.offset)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse3)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse3 (select |c_#memory_int#1| .cse3))) (not (= c_check_~a0.base .cse3)) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| c_check_~a0.base) c_check_~a0.offset)))))) (<= 0 c_check_~sum~0) (= c_check_~i~0 0) (= (select .cse2 (+ c_check_~a0.offset (* c_check_~i~0 4))) 0))) is different from true [2024-09-12 18:25:29,898 WARN L854 $PredicateComparison]: unable to prove that (and (= c_check_~sum~0 0) (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((v_main_~a~0.offset_16 Int)) (<= (select .cse0 v_main_~a~0.offset_16) |c_check_#t~mem11|)) (exists ((check_~a0.offset Int)) (<= (select .cse0 check_~a0.offset) |c_check_#t~mem11|)) (exists ((check_~a.base Int) (v_check_~a0.base_BEFORE_CALL_1 Int)) (and (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_1)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (= .cse0 (select |#memory_int#1| check_~a.base)) (<= (select .cse0 main_~a~0.offset) (select (select |#memory_int#1| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (<= (select (select |#memory_int#1| check_~a0.base) check_~a0.offset) |c_check_#t~mem11|) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| check_~a0.base) check_~a0.offset)) (not (= .cse1 check_~a0.base)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |#memory_int#1| .cse1)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1))))))))))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (v_check_~a0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (exists ((check_~a0.base Int) (check_~a0.offset Int)) (let ((.cse2 (select (select |#memory_int#1| check_~a0.base) check_~a0.offset))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base check_~a0.base)) (= .cse0 (select |#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) .cse2)) (<= .cse2 |c_check_#t~mem11|)))) (not (= v_check_~a0.base_BEFORE_CALL_1 .cse3)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse3 (select |#memory_int#1| .cse3)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse3))))) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (v_check_~a0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_1 .cse4)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse4 (select |#memory_int#1| .cse4)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse4)) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (<= (select (select |#memory_int#1| check_~a0.base) check_~a0.offset) |c_check_#t~mem11|) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| check_~a0.base) check_~a0.offset)) (not (= .cse5 check_~a0.base)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse5 (select |#memory_int#1| .cse5)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse5)))))))))) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))))) (<= 0 c_check_~sum~0) (= |c_check_#t~mem11| 0)) is different from false [2024-09-12 18:25:29,904 WARN L876 $PredicateComparison]: unable to prove that (and (= c_check_~sum~0 0) (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((v_main_~a~0.offset_16 Int)) (<= (select .cse0 v_main_~a~0.offset_16) |c_check_#t~mem11|)) (exists ((check_~a0.offset Int)) (<= (select .cse0 check_~a0.offset) |c_check_#t~mem11|)) (exists ((check_~a.base Int) (v_check_~a0.base_BEFORE_CALL_1 Int)) (and (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_1)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (= .cse0 (select |#memory_int#1| check_~a.base)) (<= (select .cse0 main_~a~0.offset) (select (select |#memory_int#1| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (<= (select (select |#memory_int#1| check_~a0.base) check_~a0.offset) |c_check_#t~mem11|) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| check_~a0.base) check_~a0.offset)) (not (= .cse1 check_~a0.base)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse1 (select |#memory_int#1| .cse1)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse1))))))))))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (v_check_~a0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (exists ((check_~a0.base Int) (check_~a0.offset Int)) (let ((.cse2 (select (select |#memory_int#1| check_~a0.base) check_~a0.offset))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base check_~a0.base)) (= .cse0 (select |#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse0 main_~a~0.offset) .cse2)) (<= .cse2 |c_check_#t~mem11|)))) (not (= v_check_~a0.base_BEFORE_CALL_1 .cse3)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse3 (select |#memory_int#1| .cse3)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse3))))) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (v_check_~a0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (v_check_~a0.offset_BEFORE_CALL_1 Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_1 .cse4)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse4 (select |#memory_int#1| .cse4)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse4)) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (<= (select (select |#memory_int#1| check_~a0.base) check_~a0.offset) |c_check_#t~mem11|) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int))) (main_~a~0.offset Int)) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |#memory_int#1|))) (and (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| check_~a0.base) check_~a0.offset)) (not (= .cse5 check_~a0.base)) (= (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse5 (select |#memory_int#1| .cse5)) |#memory_int#1|) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse5)))))))))) (<= (select .cse0 main_~a~0.offset) (select (select |v_old(#memory_int#1)_AFTER_CALL_40| v_check_~a0.base_BEFORE_CALL_1) v_check_~a0.offset_BEFORE_CALL_1)))))) (<= 0 c_check_~sum~0) (= |c_check_#t~mem11| 0)) is different from true [2024-09-12 18:25:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:25:30,407 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2024-09-12 18:25:30,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-12 18:25:30,408 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 10 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) Word has length 59 [2024-09-12 18:25:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:25:30,409 INFO L225 Difference]: With dead ends: 236 [2024-09-12 18:25:30,410 INFO L226 Difference]: Without dead ends: 235 [2024-09-12 18:25:30,411 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=144, Invalid=989, Unknown=33, NotChecked=814, Total=1980 [2024-09-12 18:25:30,411 INFO L434 NwaCegarLoop]: 75 mSDtfsCounter, 221 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1301 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-12 18:25:30,412 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1128 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1048 Invalid, 0 Unknown, 1301 Unchecked, 0.9s Time] [2024-09-12 18:25:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-09-12 18:25:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 188. [2024-09-12 18:25:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 161 states have internal predecessors, (173), 16 states have call successors, (16), 14 states have call predecessors, (16), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-12 18:25:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 202 transitions. [2024-09-12 18:25:30,468 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 202 transitions. Word has length 59 [2024-09-12 18:25:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:25:30,468 INFO L474 AbstractCegarLoop]: Abstraction has 188 states and 202 transitions. [2024-09-12 18:25:30,468 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 10 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2024-09-12 18:25:30,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:25:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 202 transitions. [2024-09-12 18:25:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-12 18:25:30,469 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:25:30,469 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, 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:30,488 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-12 18:25:30,670 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:25:30,670 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:25:30,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:25:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1118123014, now seen corresponding path program 1 times [2024-09-12 18:25:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:25:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409111420] [2024-09-12 18:25:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:25:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:25:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:25:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:25:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:25:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:25:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:25:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:25:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-12 18:25:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 18:25:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 18:25:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 18:25:31,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:25:31,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409111420] [2024-09-12 18:25:31,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409111420] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:25:31,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096178024] [2024-09-12 18:25:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:25:31,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:25:31,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:25:31,384 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:25:31,385 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-12 18:25:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:25:31,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-12 18:25:31,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:25:31,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-09-12 18:25:31,549 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:25:31,617 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-12 18:25:31,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-09-12 18:25:31,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-09-12 18:25:31,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-09-12 18:25:31,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2024-09-12 18:25:35,939 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_main_~a0~0.base) c_main_~a0~0.offset) (select .cse0 main_~a~0.offset)) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| c_main_~a~0.base)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_main_~a~0.base)))) (and (= .cse0 (select |c_#memory_int#1| c_main_~a~0.base)) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| c_main_~a0~0.base) c_main_~a0~0.offset) (select .cse0 main_~a~0.offset)))))) (not (= c_main_~a0~0.base c_main_~a~0.base))) is different from false [2024-09-12 18:25:35,943 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_main_~a0~0.base) c_main_~a0~0.offset) (select .cse0 main_~a~0.offset)) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| c_main_~a~0.base)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_main_~a~0.base)))) (and (= .cse0 (select |c_#memory_int#1| c_main_~a~0.base)) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| c_main_~a0~0.base) c_main_~a0~0.offset) (select .cse0 main_~a~0.offset)))))) (not (= c_main_~a0~0.base c_main_~a~0.base))) is different from true [2024-09-12 18:25:39,971 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_check_#in~a0.base| |c_check_#in~a.base|)) (let ((.cse1 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (= |c_check_#in~a.base| .cse0) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse0 (select |c_#memory_int#1| .cse0))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| |c_check_#in~a0.base|) |c_check_#in~a0.offset|) (select .cse1 main_~a~0.offset)) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| |c_check_#in~a.base|))))) (and (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| |c_check_#in~a0.base|) |c_check_#in~a0.offset|) (select .cse1 main_~a~0.offset))) (= .cse1 (select |c_#memory_int#1| |c_check_#in~a.base|)))))) is different from false [2024-09-12 18:25:39,974 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_check_#in~a0.base| |c_check_#in~a.base|)) (let ((.cse1 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (= |c_check_#in~a.base| .cse0) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse0 (select |c_#memory_int#1| .cse0))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| |c_check_#in~a0.base|) |c_check_#in~a0.offset|) (select .cse1 main_~a~0.offset)) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| |c_check_#in~a.base|))))) (and (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| |c_check_#in~a0.base|) |c_check_#in~a0.offset|) (select .cse1 main_~a~0.offset))) (= .cse1 (select |c_#memory_int#1| |c_check_#in~a.base|)))))) is different from true [2024-09-12 18:25:44,026 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse1)) (not (= c_check_~a0.base .cse1))))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset)))))) (<= c_check_~sum~0 0) (= c_check_~i~0 0)) is different from false [2024-09-12 18:25:44,029 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse1)) (not (= c_check_~a0.base .cse1))))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset)))))) (<= c_check_~sum~0 0) (= c_check_~i~0 0)) is different from true [2024-09-12 18:25:48,094 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0))) (or (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse0 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse0)) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset)) (not (= v_check_~a0.base_BEFORE_CALL_3 .cse0))))) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (and (exists ((check_~a.base Int)) (and (= .cse1 (select |c_#memory_int#1| check_~a.base)) (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_3)))) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset))))))) is different from false [2024-09-12 18:25:52,124 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0))) (or (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse0 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse0)) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset)) (not (= v_check_~a0.base_BEFORE_CALL_3 .cse0))))) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (and (exists ((check_~a.base Int)) (and (= .cse1 (select |c_#memory_int#1| check_~a.base)) (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_3)))) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset))))))) is different from true [2024-09-12 18:25:56,281 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse1)) (not (= c_check_~a0.base .cse1))))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset))))) (<= c_check_~sum~0 0) (= c_check_~i~0 0) (or (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse2)) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse0 main_~a~0.offset)) (not (= v_check_~a0.base_BEFORE_CALL_3 .cse2))))) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (and (exists ((check_~a.base Int)) (and (= .cse0 (select |c_#memory_int#1| check_~a.base)) (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_3)))) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse0 main_~a~0.offset)))))))) is different from false [2024-09-12 18:25:56,285 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse1)) (not (= c_check_~a0.base .cse1))))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset))))) (<= c_check_~sum~0 0) (= c_check_~i~0 0) (or (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse2)) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse0 main_~a~0.offset)) (not (= v_check_~a0.base_BEFORE_CALL_3 .cse2))))) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (and (exists ((check_~a.base Int)) (and (= .cse0 (select |c_#memory_int#1| check_~a.base)) (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_3)))) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse0 main_~a~0.offset)))))))) is different from true [2024-09-12 18:25:56,530 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-09-12 18:25:56,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 54 [2024-09-12 18:25:56,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 10 [2024-09-12 18:26:00,642 WARN L854 $PredicateComparison]: unable to prove that (and (<= c_check_~sum~0 0) (let ((.cse1 ((as const (Array Int Int)) 0))) (or (exists ((check_~a.base Int) (check_~a0.base Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int))) (main_~a~0.offset Int) (check_~a0.offset Int)) (let ((.cse0 (select (select |#memory_int#1| check_~a0.base) check_~a0.offset))) (and (<= .cse0 (select .cse1 main_~a~0.offset)) (<= |c_check_#t~mem11| .cse0) (= .cse1 (select |#memory_int#1| check_~a.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_3 .cse2)) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse2)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse2 (select |#memory_int#1| .cse2))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset)))))))) (not (= check_~a.base check_~a0.base)))) (exists ((main_~a~0.offset Int)) (<= |c_check_#t~mem11| (select .cse1 main_~a~0.offset))) (exists ((main_~a~0.offset Int) (check_~a0.base Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (check_~a0.offset Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse3)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse3 (select |#memory_int#1| .cse3))) (<= |c_check_#t~mem11| (select (select |#memory_int#1| check_~a0.base) check_~a0.offset)) (not (= .cse3 check_~a0.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_3 .cse4)) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse4)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse4 (select |#memory_int#1| .cse4))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset)))))))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| check_~a0.base) check_~a0.offset) (select .cse1 main_~a~0.offset)))) (exists ((main_~a~0.offset Int) (check_~a0.base Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (check_~a0.offset Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse5)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse5 (select |#memory_int#1| .cse5))) (<= |c_check_#t~mem11| (select (select |#memory_int#1| check_~a0.base) check_~a0.offset)) (not (= .cse5 check_~a0.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (and (exists ((main_~a~0.offset Int)) (<= (select (select |#memory_int#1| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset))) (exists ((check_~a.base Int)) (and (= .cse1 (select |#memory_int#1| check_~a.base)) (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_3))))))))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| check_~a0.base) check_~a0.offset) (select .cse1 main_~a~0.offset))))))) is different from false [2024-09-12 18:26:00,647 WARN L876 $PredicateComparison]: unable to prove that (and (<= c_check_~sum~0 0) (let ((.cse1 ((as const (Array Int Int)) 0))) (or (exists ((check_~a.base Int) (check_~a0.base Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int))) (main_~a~0.offset Int) (check_~a0.offset Int)) (let ((.cse0 (select (select |#memory_int#1| check_~a0.base) check_~a0.offset))) (and (<= .cse0 (select .cse1 main_~a~0.offset)) (<= |c_check_#t~mem11| .cse0) (= .cse1 (select |#memory_int#1| check_~a.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_3 .cse2)) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse2)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse2 (select |#memory_int#1| .cse2))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset)))))))) (not (= check_~a.base check_~a0.base)))) (exists ((main_~a~0.offset Int)) (<= |c_check_#t~mem11| (select .cse1 main_~a~0.offset))) (exists ((main_~a~0.offset Int) (check_~a0.base Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (check_~a0.offset Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse3)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse3 (select |#memory_int#1| .cse3))) (<= |c_check_#t~mem11| (select (select |#memory_int#1| check_~a0.base) check_~a0.offset)) (not (= .cse3 check_~a0.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_3 .cse4)) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse4)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse4 (select |#memory_int#1| .cse4))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset)))))))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| check_~a0.base) check_~a0.offset) (select .cse1 main_~a~0.offset)))) (exists ((main_~a~0.offset Int) (check_~a0.base Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (check_~a0.offset Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse5)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse5 (select |#memory_int#1| .cse5))) (<= |c_check_#t~mem11| (select (select |#memory_int#1| check_~a0.base) check_~a0.offset)) (not (= .cse5 check_~a0.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (and (exists ((main_~a~0.offset Int)) (<= (select (select |#memory_int#1| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset))) (exists ((check_~a.base Int)) (and (= .cse1 (select |#memory_int#1| check_~a.base)) (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_3))))))))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| check_~a0.base) check_~a0.offset) (select .cse1 main_~a~0.offset))))))) is different from true [2024-09-12 18:26:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:26:00,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:26:00,932 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_416 (Array Int Int))) (< (select (select (store |c_#memory_int#1| c_main_~a~0.base v_ArrVal_416) c_main_~a0~0.base) c_main_~a0~0.offset) 2147483648)) is different from false [2024-09-12 18:26:00,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096178024] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:00,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:26:00,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 26 [2024-09-12 18:26:00,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936226408] [2024-09-12 18:26:00,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:26:00,935 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-12 18:26:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-12 18:26:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=536, Unknown=13, NotChecked=364, Total=992 [2024-09-12 18:26:00,936 INFO L87 Difference]: Start difference. First operand 188 states and 202 transitions. Second operand has 27 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 10 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2024-09-12 18:26:05,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| c_main_~a0~0.base))) (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_main_~a0~0.base) c_main_~a0~0.offset) (select .cse0 main_~a~0.offset)) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| c_main_~a~0.base)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_main_~a~0.base)))) (and (= .cse0 (select |c_#memory_int#1| c_main_~a~0.base)) (exists ((main_~a~0.offset Int)) (<= (select .cse2 c_main_~a0~0.offset) (select .cse0 main_~a~0.offset)))))) (not (= c_main_~a0~0.base c_main_~a~0.base)) (= 0 c_main_~a0~0.offset) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_3| Int)) (= (select |c_#valid| |v_main_#t~malloc15.base_BEFORE_CALL_3|) 1)) (= (select .cse2 0) 0))) is different from false [2024-09-12 18:26:05,590 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| c_main_~a0~0.base))) (and (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_main_~a0~0.base) c_main_~a0~0.offset) (select .cse0 main_~a~0.offset)) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| c_main_~a~0.base)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_main_~a~0.base)))) (and (= .cse0 (select |c_#memory_int#1| c_main_~a~0.base)) (exists ((main_~a~0.offset Int)) (<= (select .cse2 c_main_~a0~0.offset) (select .cse0 main_~a~0.offset)))))) (not (= c_main_~a0~0.base c_main_~a~0.base)) (= 0 c_main_~a0~0.offset) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_3| Int)) (= (select |c_#valid| |v_main_#t~malloc15.base_BEFORE_CALL_3|) 1)) (= (select .cse2 0) 0))) is different from true [2024-09-12 18:26:09,594 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_check_#in~a0.base|))) (and (= (select .cse0 0) 0) (= |c_check_#in~a0.offset| 0) (not (= |c_check_#in~a0.base| |c_check_#in~a.base|)) (let ((.cse2 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (= |c_check_#in~a.base| .cse1) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| |c_check_#in~a0.base|) |c_check_#in~a0.offset|) (select .cse2 main_~a~0.offset)) (= .cse2 (select |v_old(#memory_int#1)_AFTER_CALL_47| |c_check_#in~a.base|))))) (and (exists ((main_~a~0.offset Int)) (<= (select .cse0 |c_check_#in~a0.offset|) (select .cse2 main_~a~0.offset))) (= .cse2 (select |c_#memory_int#1| |c_check_#in~a.base|))))))) is different from false [2024-09-12 18:26:09,598 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_check_#in~a0.base|))) (and (= (select .cse0 0) 0) (= |c_check_#in~a0.offset| 0) (not (= |c_check_#in~a0.base| |c_check_#in~a.base|)) (let ((.cse2 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (= |c_check_#in~a.base| .cse1) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| |c_check_#in~a0.base|) |c_check_#in~a0.offset|) (select .cse2 main_~a~0.offset)) (= .cse2 (select |v_old(#memory_int#1)_AFTER_CALL_47| |c_check_#in~a.base|))))) (and (exists ((main_~a~0.offset Int)) (<= (select .cse0 |c_check_#in~a0.offset|) (select .cse2 main_~a~0.offset))) (= .cse2 (select |c_#memory_int#1| |c_check_#in~a.base|))))))) is different from true [2024-09-12 18:26:13,601 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| c_check_~a0.base))) (and (= c_check_~sum~0 0) (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse1)) (not (= c_check_~a0.base .cse1))))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse2 c_check_~a0.offset) (select .cse0 main_~a~0.offset)))))) (<= c_check_~sum~0 0) (= c_check_~i~0 0) (= (select .cse2 (+ c_check_~a0.offset (* c_check_~i~0 4))) 0))) is different from false [2024-09-12 18:26:13,604 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| c_check_~a0.base))) (and (= c_check_~sum~0 0) (let ((.cse0 ((as const (Array Int Int)) 0))) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse1)) (not (= c_check_~a0.base .cse1))))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse2 c_check_~a0.offset) (select .cse0 main_~a~0.offset)))))) (<= c_check_~sum~0 0) (= c_check_~i~0 0) (= (select .cse2 (+ c_check_~a0.offset (* c_check_~i~0 4))) 0))) is different from true [2024-09-12 18:26:17,622 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int#1| c_check_~a0.base))) (and (= c_check_~sum~0 0) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse1)) (not (= c_check_~a0.base .cse1))))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse2 c_check_~a0.offset) (select .cse0 main_~a~0.offset))))) (<= c_check_~sum~0 0) (= c_check_~i~0 0) (or (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse3 (select |c_#memory_int#1| .cse3))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse3)) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse0 main_~a~0.offset)) (not (= v_check_~a0.base_BEFORE_CALL_3 .cse3))))) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (and (exists ((check_~a.base Int)) (and (= .cse0 (select |c_#memory_int#1| check_~a.base)) (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_3)))) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse0 main_~a~0.offset)))))) (= (select .cse2 (+ c_check_~a0.offset (* c_check_~i~0 4))) 0))) is different from false [2024-09-12 18:26:17,626 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int#1| c_check_~a0.base))) (and (= c_check_~sum~0 0) (or (exists ((main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| c_check_~a0.base) c_check_~a0.offset) (select .cse0 main_~a~0.offset)) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse1)) (not (= c_check_~a0.base .cse1))))) (and (exists ((check_~a.base Int)) (and (not (= check_~a.base c_check_~a0.base)) (= .cse0 (select |c_#memory_int#1| check_~a.base)))) (exists ((main_~a~0.offset Int)) (<= (select .cse2 c_check_~a0.offset) (select .cse0 main_~a~0.offset))))) (<= c_check_~sum~0 0) (= c_check_~i~0 0) (or (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse3 (select |c_#memory_int#1| .cse3))) (= .cse0 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse3)) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse0 main_~a~0.offset)) (not (= v_check_~a0.base_BEFORE_CALL_3 .cse3))))) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (and (exists ((check_~a.base Int)) (and (= .cse0 (select |c_#memory_int#1| check_~a.base)) (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_3)))) (exists ((main_~a~0.offset Int)) (<= (select (select |c_#memory_int#1| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse0 main_~a~0.offset)))))) (= (select .cse2 (+ c_check_~a0.offset (* c_check_~i~0 4))) 0))) is different from true [2024-09-12 18:26:17,637 WARN L854 $PredicateComparison]: unable to prove that (and (= c_check_~sum~0 0) (<= c_check_~sum~0 0) (let ((.cse1 ((as const (Array Int Int)) 0))) (or (exists ((check_~a.base Int) (check_~a0.base Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int))) (main_~a~0.offset Int) (check_~a0.offset Int)) (let ((.cse0 (select (select |#memory_int#1| check_~a0.base) check_~a0.offset))) (and (<= .cse0 (select .cse1 main_~a~0.offset)) (<= |c_check_#t~mem11| .cse0) (= .cse1 (select |#memory_int#1| check_~a.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_3 .cse2)) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse2)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse2 (select |#memory_int#1| .cse2))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset)))))))) (not (= check_~a.base check_~a0.base)))) (exists ((main_~a~0.offset Int)) (<= |c_check_#t~mem11| (select .cse1 main_~a~0.offset))) (exists ((main_~a~0.offset Int) (check_~a0.base Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (check_~a0.offset Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse3)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse3 (select |#memory_int#1| .cse3))) (<= |c_check_#t~mem11| (select (select |#memory_int#1| check_~a0.base) check_~a0.offset)) (not (= .cse3 check_~a0.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_3 .cse4)) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse4)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse4 (select |#memory_int#1| .cse4))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset)))))))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| check_~a0.base) check_~a0.offset) (select .cse1 main_~a~0.offset)))) (exists ((main_~a~0.offset Int) (check_~a0.base Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (check_~a0.offset Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse5)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse5 (select |#memory_int#1| .cse5))) (<= |c_check_#t~mem11| (select (select |#memory_int#1| check_~a0.base) check_~a0.offset)) (not (= .cse5 check_~a0.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (and (exists ((main_~a~0.offset Int)) (<= (select (select |#memory_int#1| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset))) (exists ((check_~a.base Int)) (and (= .cse1 (select |#memory_int#1| check_~a.base)) (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_3))))))))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| check_~a0.base) check_~a0.offset) (select .cse1 main_~a~0.offset)))))) (= |c_check_#t~mem11| 0)) is different from false [2024-09-12 18:26:17,641 WARN L876 $PredicateComparison]: unable to prove that (and (= c_check_~sum~0 0) (<= c_check_~sum~0 0) (let ((.cse1 ((as const (Array Int Int)) 0))) (or (exists ((check_~a.base Int) (check_~a0.base Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int))) (main_~a~0.offset Int) (check_~a0.offset Int)) (let ((.cse0 (select (select |#memory_int#1| check_~a0.base) check_~a0.offset))) (and (<= .cse0 (select .cse1 main_~a~0.offset)) (<= |c_check_#t~mem11| .cse0) (= .cse1 (select |#memory_int#1| check_~a.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_3 .cse2)) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse2)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse2 (select |#memory_int#1| .cse2))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset)))))))) (not (= check_~a.base check_~a0.base)))) (exists ((main_~a~0.offset Int)) (<= |c_check_#t~mem11| (select .cse1 main_~a~0.offset))) (exists ((main_~a~0.offset Int) (check_~a0.base Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (check_~a0.offset Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse3)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse3 (select |#memory_int#1| .cse3))) (<= |c_check_#t~mem11| (select (select |#memory_int#1| check_~a0.base) check_~a0.offset)) (not (= .cse3 check_~a0.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (main_~a~0.offset Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (not (= v_check_~a0.base_BEFORE_CALL_3 .cse4)) (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse4)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse4 (select |#memory_int#1| .cse4))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset)))))))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| check_~a0.base) check_~a0.offset) (select .cse1 main_~a~0.offset)))) (exists ((main_~a~0.offset Int) (check_~a0.base Int) (|v_old(#memory_int#1)_AFTER_CALL_47| (Array Int (Array Int Int))) (check_~a0.offset Int)) (and (exists ((|#memory_int#1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_47| |#memory_int#1|))) (and (= .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_47| .cse5)) (= |#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_47| .cse5 (select |#memory_int#1| .cse5))) (<= |c_check_#t~mem11| (select (select |#memory_int#1| check_~a0.base) check_~a0.offset)) (not (= .cse5 check_~a0.base)) (exists ((v_check_~a0.base_BEFORE_CALL_3 Int) (v_check_~a0.offset_BEFORE_CALL_3 Int)) (and (exists ((main_~a~0.offset Int)) (<= (select (select |#memory_int#1| v_check_~a0.base_BEFORE_CALL_3) v_check_~a0.offset_BEFORE_CALL_3) (select .cse1 main_~a~0.offset))) (exists ((check_~a.base Int)) (and (= .cse1 (select |#memory_int#1| check_~a.base)) (not (= check_~a.base v_check_~a0.base_BEFORE_CALL_3))))))))) (<= (select (select |v_old(#memory_int#1)_AFTER_CALL_47| check_~a0.base) check_~a0.offset) (select .cse1 main_~a~0.offset)))))) (= |c_check_#t~mem11| 0)) is different from true [2024-09-12 18:26:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:18,038 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2024-09-12 18:26:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-12 18:26:18,038 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 10 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) Word has length 60 [2024-09-12 18:26:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:18,040 INFO L225 Difference]: With dead ends: 237 [2024-09-12 18:26:18,040 INFO L226 Difference]: Without dead ends: 236 [2024-09-12 18:26:18,041 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=141, Invalid=940, Unknown=23, NotChecked=876, Total=1980 [2024-09-12 18:26:18,042 INFO L434 NwaCegarLoop]: 76 mSDtfsCounter, 221 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1325 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:18,042 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 935 Invalid, 2270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 898 Invalid, 0 Unknown, 1325 Unchecked, 0.8s Time] [2024-09-12 18:26:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-09-12 18:26:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 189. [2024-09-12 18:26:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 162 states have internal predecessors, (174), 16 states have call successors, (16), 14 states have call predecessors, (16), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-12 18:26:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 203 transitions. [2024-09-12 18:26:18,088 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 203 transitions. Word has length 60 [2024-09-12 18:26:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:18,088 INFO L474 AbstractCegarLoop]: Abstraction has 189 states and 203 transitions. [2024-09-12 18:26:18,088 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 10 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2024-09-12 18:26:18,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 203 transitions. [2024-09-12 18:26:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-12 18:26:18,089 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:18,089 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:18,106 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-12 18:26:18,293 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-09-12 18:26:18,294 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting upsweepErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:18,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1791682943, now seen corresponding path program 2 times [2024-09-12 18:26:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:18,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990313668] [2024-09-12 18:26:18,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:18,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:18,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:18,380 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:18,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:18,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:18,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-12 18:26:18,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990313668] [2024-09-12 18:26:18,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990313668] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436478075] [2024-09-12 18:26:18,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:26:18,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:18,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:26:18,398 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:26:18,399 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-12 18:26:18,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 18:26:18,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:26:18,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 18:26:18,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:26:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-12 18:26:18,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:26:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-12 18:26:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436478075] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:26:18,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:26:18,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-09-12 18:26:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677141403] [2024-09-12 18:26:18,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:26:18,790 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 18:26:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:18,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 18:26:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-12 18:26:18,791 INFO L87 Difference]: Start difference. First operand 189 states and 203 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-12 18:26:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:19,340 INFO L93 Difference]: Finished difference Result 216 states and 232 transitions. [2024-09-12 18:26:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 18:26:19,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 57 [2024-09-12 18:26:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:19,342 INFO L225 Difference]: With dead ends: 216 [2024-09-12 18:26:19,342 INFO L226 Difference]: Without dead ends: 214 [2024-09-12 18:26:19,343 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2024-09-12 18:26:19,343 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 146 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:19,343 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 508 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 18:26:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-09-12 18:26:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2024-09-12 18:26:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 147 states have (on average 1.2448979591836735) internal successors, (183), 171 states have internal predecessors, (183), 16 states have call successors, (16), 14 states have call predecessors, (16), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-12 18:26:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 212 transitions. [2024-09-12 18:26:19,398 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 212 transitions. Word has length 57 [2024-09-12 18:26:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:19,398 INFO L474 AbstractCegarLoop]: Abstraction has 198 states and 212 transitions. [2024-09-12 18:26:19,398 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-12 18:26:19,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 212 transitions. [2024-09-12 18:26:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 18:26:19,400 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:19,400 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, 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:26:19,418 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-09-12 18:26:19,600 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-09-12 18:26:19,601 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:19,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 302080797, now seen corresponding path program 1 times [2024-09-12 18:26:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:19,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855983092] [2024-09-12 18:26:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:19,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:19,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:19,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:19,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:19,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:19,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:19,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:19,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-12 18:26:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:19,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 18:26:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:19,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 18:26:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 18:26:19,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:19,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855983092] [2024-09-12 18:26:19,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855983092] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:26:19,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:26:19,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:26:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7067686] [2024-09-12 18:26:19,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:26:19,688 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:26:19,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:19,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:26:19,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:26:19,689 INFO L87 Difference]: Start difference. First operand 198 states and 212 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-12 18:26:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:19,917 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2024-09-12 18:26:19,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:26:19,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2024-09-12 18:26:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:19,919 INFO L225 Difference]: With dead ends: 216 [2024-09-12 18:26:19,919 INFO L226 Difference]: Without dead ends: 214 [2024-09-12 18:26:19,919 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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:26:19,919 INFO L434 NwaCegarLoop]: 83 mSDtfsCounter, 49 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:19,920 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 309 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:26:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-09-12 18:26:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 205. [2024-09-12 18:26:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 153 states have (on average 1.2483660130718954) internal successors, (191), 177 states have internal predecessors, (191), 17 states have call successors, (17), 14 states have call predecessors, (17), 11 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-12 18:26:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 222 transitions. [2024-09-12 18:26:19,974 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 222 transitions. Word has length 61 [2024-09-12 18:26:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:19,975 INFO L474 AbstractCegarLoop]: Abstraction has 205 states and 222 transitions. [2024-09-12 18:26:19,975 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-12 18:26:19,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 222 transitions. [2024-09-12 18:26:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 18:26:19,976 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:19,976 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:19,976 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-09-12 18:26:19,976 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting upsweepErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:19,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2037757542, now seen corresponding path program 1 times [2024-09-12 18:26:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862716286] [2024-09-12 18:26:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:20,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:20,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:20,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:20,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:20,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:20,042 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-12 18:26:20,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:20,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862716286] [2024-09-12 18:26:20,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862716286] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:20,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442475785] [2024-09-12 18:26:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:20,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:20,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:26:20,046 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:26:20,048 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-09-12 18:26:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:20,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 18:26:20,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:26:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:26:20,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:26:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:26:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442475785] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:26:20,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:26:20,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12, 12] total 18 [2024-09-12 18:26:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060966238] [2024-09-12 18:26:20,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:26:20,557 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 18:26:20,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 18:26:20,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-09-12 18:26:20,558 INFO L87 Difference]: Start difference. First operand 205 states and 222 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 16 states have internal predecessors, (83), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:26:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:21,492 INFO L93 Difference]: Finished difference Result 349 states and 384 transitions. [2024-09-12 18:26:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-12 18:26:21,493 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 16 states have internal predecessors, (83), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2024-09-12 18:26:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:21,494 INFO L225 Difference]: With dead ends: 349 [2024-09-12 18:26:21,494 INFO L226 Difference]: Without dead ends: 257 [2024-09-12 18:26:21,495 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 113 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2024-09-12 18:26:21,495 INFO L434 NwaCegarLoop]: 72 mSDtfsCounter, 218 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:21,496 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 797 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 18:26:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-09-12 18:26:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 221. [2024-09-12 18:26:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 169 states have (on average 1.2544378698224852) internal successors, (212), 193 states have internal predecessors, (212), 17 states have call successors, (17), 14 states have call predecessors, (17), 11 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-12 18:26:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2024-09-12 18:26:21,553 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 61 [2024-09-12 18:26:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:21,553 INFO L474 AbstractCegarLoop]: Abstraction has 221 states and 243 transitions. [2024-09-12 18:26:21,553 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 16 states have internal predecessors, (83), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:26:21,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 243 transitions. [2024-09-12 18:26:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-12 18:26:21,554 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:21,555 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:21,571 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-09-12 18:26:21,755 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-09-12 18:26:21,755 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:21,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:21,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1952145145, now seen corresponding path program 1 times [2024-09-12 18:26:21,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:21,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009327189] [2024-09-12 18:26:21,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:21,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:21,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:21,936 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:21,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:21,940 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:21,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:21,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:21,957 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-12 18:26:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:21,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 18:26:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:21,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 18:26:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:26:21,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009327189] [2024-09-12 18:26:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009327189] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236820202] [2024-09-12 18:26:21,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:21,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:21,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:26:21,970 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:26:21,972 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-09-12 18:26:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:22,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 18:26:22,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:26:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:26:22,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:26:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:26:22,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236820202] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:26:22,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:26:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2024-09-12 18:26:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812970640] [2024-09-12 18:26:22,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:26:22,324 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 18:26:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 18:26:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-09-12 18:26:22,325 INFO L87 Difference]: Start difference. First operand 221 states and 243 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 6 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-12 18:26:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:22,727 INFO L93 Difference]: Finished difference Result 248 states and 270 transitions. [2024-09-12 18:26:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 18:26:22,728 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 6 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 67 [2024-09-12 18:26:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:22,729 INFO L225 Difference]: With dead ends: 248 [2024-09-12 18:26:22,729 INFO L226 Difference]: Without dead ends: 202 [2024-09-12 18:26:22,730 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-09-12 18:26:22,730 INFO L434 NwaCegarLoop]: 80 mSDtfsCounter, 54 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:22,730 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 844 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:26:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-09-12 18:26:22,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2024-09-12 18:26:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.28) internal successors, (192), 174 states have internal predecessors, (192), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-12 18:26:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2024-09-12 18:26:22,794 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 67 [2024-09-12 18:26:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:22,794 INFO L474 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2024-09-12 18:26:22,794 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 6 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-12 18:26:22,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2024-09-12 18:26:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-09-12 18:26:22,795 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:22,795 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:22,808 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-09-12 18:26:22,995 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-09-12 18:26:22,996 INFO L399 AbstractCegarLoop]: === Iteration 29 === Targeting downsweepErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:22,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1190283347, now seen corresponding path program 1 times [2024-09-12 18:26:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939295579] [2024-09-12 18:26:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:23,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:23,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:23,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:23,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:23,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:23,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:23,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 18:26:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 18:26:23,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:23,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939295579] [2024-09-12 18:26:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939295579] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326034274] [2024-09-12 18:26:23,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:23,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:23,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:26:23,296 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:26:23,298 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-09-12 18:26:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:23,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 18:26:23,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:26:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 18:26:23,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:26:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326034274] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:26:23,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:26:23,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 13 [2024-09-12 18:26:23,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779809467] [2024-09-12 18:26:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:26:23,455 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 18:26:23,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:23,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 18:26:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-09-12 18:26:23,456 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand has 9 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:26:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:23,719 INFO L93 Difference]: Finished difference Result 210 states and 231 transitions. [2024-09-12 18:26:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 18:26:23,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2024-09-12 18:26:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:23,721 INFO L225 Difference]: With dead ends: 210 [2024-09-12 18:26:23,721 INFO L226 Difference]: Without dead ends: 209 [2024-09-12 18:26:23,721 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-09-12 18:26:23,722 INFO L434 NwaCegarLoop]: 91 mSDtfsCounter, 52 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:23,722 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 573 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:26:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-09-12 18:26:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2024-09-12 18:26:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 173 states have internal predecessors, (191), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-12 18:26:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2024-09-12 18:26:23,777 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 64 [2024-09-12 18:26:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:23,778 INFO L474 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2024-09-12 18:26:23,778 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:26:23,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2024-09-12 18:26:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-09-12 18:26:23,778 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:23,778 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:23,792 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-09-12 18:26:23,979 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,17 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:23,979 INFO L399 AbstractCegarLoop]: === Iteration 30 === Targeting downsweepErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:23,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1755922011, now seen corresponding path program 1 times [2024-09-12 18:26:23,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:23,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156265666] [2024-09-12 18:26:23,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:23,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:24,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:24,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:24,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:24,093 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:24,108 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:24,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:24,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 18:26:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 18:26:24,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:24,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156265666] [2024-09-12 18:26:24,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156265666] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:24,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413916562] [2024-09-12 18:26:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:24,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:24,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:26:24,175 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:26:24,177 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-09-12 18:26:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:24,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-12 18:26:24,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:26:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 18:26:24,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:26:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 18:26:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413916562] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:26:24,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:26:24,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-09-12 18:26:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887787202] [2024-09-12 18:26:24,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:26:24,839 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-12 18:26:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:24,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-12 18:26:24,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2024-09-12 18:26:24,840 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand has 25 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 4 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (9), 4 states have call predecessors, (9), 1 states have call successors, (9) [2024-09-12 18:26:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:25,840 INFO L93 Difference]: Finished difference Result 265 states and 291 transitions. [2024-09-12 18:26:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 18:26:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 4 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (9), 4 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2024-09-12 18:26:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:25,842 INFO L225 Difference]: With dead ends: 265 [2024-09-12 18:26:25,842 INFO L226 Difference]: Without dead ends: 259 [2024-09-12 18:26:25,843 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2024-09-12 18:26:25,843 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 205 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:25,843 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 487 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-12 18:26:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-09-12 18:26:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 237. [2024-09-12 18:26:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 192 states have (on average 1.2447916666666667) internal successors, (239), 214 states have internal predecessors, (239), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-12 18:26:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 267 transitions. [2024-09-12 18:26:25,900 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 267 transitions. Word has length 65 [2024-09-12 18:26:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:25,900 INFO L474 AbstractCegarLoop]: Abstraction has 237 states and 267 transitions. [2024-09-12 18:26:25,901 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 4 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (9), 4 states have call predecessors, (9), 1 states have call successors, (9) [2024-09-12 18:26:25,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 267 transitions. [2024-09-12 18:26:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-12 18:26:25,901 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:25,901 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:25,915 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-09-12 18:26:26,102 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:26,102 INFO L399 AbstractCegarLoop]: === Iteration 31 === Targeting downsweepErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:26,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1694730917, now seen corresponding path program 1 times [2024-09-12 18:26:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:26,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981111809] [2024-09-12 18:26:26,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,184 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 18:26:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-12 18:26:26,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:26,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981111809] [2024-09-12 18:26:26,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981111809] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:26:26,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:26:26,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:26:26,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904917984] [2024-09-12 18:26:26,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:26:26,189 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:26:26,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:26,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:26:26,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:26:26,190 INFO L87 Difference]: Start difference. First operand 237 states and 267 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:26:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:26,499 INFO L93 Difference]: Finished difference Result 237 states and 267 transitions. [2024-09-12 18:26:26,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:26:26,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2024-09-12 18:26:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:26,502 INFO L225 Difference]: With dead ends: 237 [2024-09-12 18:26:26,502 INFO L226 Difference]: Without dead ends: 235 [2024-09-12 18:26:26,502 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:26:26,503 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 62 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:26,503 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 190 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:26:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-09-12 18:26:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-09-12 18:26:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 192 states have (on average 1.2239583333333333) internal successors, (235), 212 states have internal predecessors, (235), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-12 18:26:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 263 transitions. [2024-09-12 18:26:26,568 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 263 transitions. Word has length 72 [2024-09-12 18:26:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:26,568 INFO L474 AbstractCegarLoop]: Abstraction has 235 states and 263 transitions. [2024-09-12 18:26:26,568 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:26:26,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 263 transitions. [2024-09-12 18:26:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-09-12 18:26:26,569 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:26,569 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:26,569 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-09-12 18:26:26,570 INFO L399 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:26,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:26,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1374463236, now seen corresponding path program 1 times [2024-09-12 18:26:26,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:26,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481906961] [2024-09-12 18:26:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 18:26:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 18:26:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 18:26:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481906961] [2024-09-12 18:26:26,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481906961] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601992850] [2024-09-12 18:26:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:26,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:26,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:26:26,904 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:26:26,905 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-09-12 18:26:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:27,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 18:26:27,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:26:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 18:26:27,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:26:27,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601992850] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:26:27,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:26:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 17 [2024-09-12 18:26:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388294884] [2024-09-12 18:26:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:26:27,263 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 18:26:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 18:26:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2024-09-12 18:26:27,264 INFO L87 Difference]: Start difference. First operand 235 states and 263 transitions. Second operand has 10 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-12 18:26:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:27,878 INFO L93 Difference]: Finished difference Result 301 states and 345 transitions. [2024-09-12 18:26:27,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 18:26:27,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2024-09-12 18:26:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:27,881 INFO L225 Difference]: With dead ends: 301 [2024-09-12 18:26:27,881 INFO L226 Difference]: Without dead ends: 271 [2024-09-12 18:26:27,881 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2024-09-12 18:26:27,882 INFO L434 NwaCegarLoop]: 71 mSDtfsCounter, 34 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:27,882 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 553 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 18:26:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-09-12 18:26:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 237. [2024-09-12 18:26:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 194 states have (on average 1.2216494845360826) internal successors, (237), 214 states have internal predecessors, (237), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-12 18:26:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2024-09-12 18:26:27,976 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 75 [2024-09-12 18:26:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:27,977 INFO L474 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2024-09-12 18:26:27,977 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-12 18:26:27,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2024-09-12 18:26:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-12 18:26:27,978 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:27,978 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:27,997 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-09-12 18:26:28,182 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-09-12 18:26:28,183 INFO L399 AbstractCegarLoop]: === Iteration 33 === Targeting downsweepErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:28,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash -997050742, now seen corresponding path program 1 times [2024-09-12 18:26:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:28,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879353039] [2024-09-12 18:26:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:28,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:28,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:28,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:28,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:28,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:28,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:28,406 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:28,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 18:26:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:26:28,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879353039] [2024-09-12 18:26:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879353039] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764838812] [2024-09-12 18:26:28,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:28,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:28,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:26:28,418 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:26:28,420 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-09-12 18:26:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:28,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 18:26:28,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:26:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-12 18:26:28,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:26:28,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764838812] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:26:28,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:26:28,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2024-09-12 18:26:28,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094294226] [2024-09-12 18:26:28,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:26:28,609 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:26:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:28,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:26:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-09-12 18:26:28,610 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:26:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:28,793 INFO L93 Difference]: Finished difference Result 263 states and 299 transitions. [2024-09-12 18:26:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:26:28,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-09-12 18:26:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:28,796 INFO L225 Difference]: With dead ends: 263 [2024-09-12 18:26:28,796 INFO L226 Difference]: Without dead ends: 259 [2024-09-12 18:26:28,796 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-09-12 18:26:28,797 INFO L434 NwaCegarLoop]: 88 mSDtfsCounter, 26 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:28,797 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 245 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:26:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-09-12 18:26:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 243. [2024-09-12 18:26:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 202 states have (on average 1.2128712871287128) internal successors, (245), 220 states have internal predecessors, (245), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-12 18:26:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 273 transitions. [2024-09-12 18:26:28,878 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 273 transitions. Word has length 73 [2024-09-12 18:26:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:28,879 INFO L474 AbstractCegarLoop]: Abstraction has 243 states and 273 transitions. [2024-09-12 18:26:28,879 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-12 18:26:28,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 273 transitions. [2024-09-12 18:26:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-12 18:26:28,880 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:28,881 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:28,909 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-09-12 18:26:29,081 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-09-12 18:26:29,081 INFO L399 AbstractCegarLoop]: === Iteration 34 === Targeting upsweepErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:29,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:29,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1217798111, now seen corresponding path program 1 times [2024-09-12 18:26:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:29,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980381698] [2024-09-12 18:26:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:29,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:29,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:29,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:29,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:29,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:29,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:29,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-12 18:26:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:29,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980381698] [2024-09-12 18:26:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980381698] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:29,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012804419] [2024-09-12 18:26:29,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:29,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:29,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:26:29,173 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:26:29,174 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-09-12 18:26:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:29,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:26:29,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:26:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-12 18:26:29,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:26:29,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012804419] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:26:29,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:26:29,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-09-12 18:26:29,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522333706] [2024-09-12 18:26:29,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:26:29,375 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:26:29,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:26:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:26:29,376 INFO L87 Difference]: Start difference. First operand 243 states and 273 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:26:29,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:29,564 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2024-09-12 18:26:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:26:29,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 72 [2024-09-12 18:26:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:29,566 INFO L225 Difference]: With dead ends: 243 [2024-09-12 18:26:29,566 INFO L226 Difference]: Without dead ends: 241 [2024-09-12 18:26:29,566 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:26:29,567 INFO L434 NwaCegarLoop]: 89 mSDtfsCounter, 19 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:29,567 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 254 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:26:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-09-12 18:26:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-09-12 18:26:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 202 states have (on average 1.193069306930693) internal successors, (241), 218 states have internal predecessors, (241), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-12 18:26:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2024-09-12 18:26:29,656 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 72 [2024-09-12 18:26:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:29,657 INFO L474 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2024-09-12 18:26:29,657 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:26:29,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2024-09-12 18:26:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-12 18:26:29,658 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:29,658 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:29,683 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-09-12 18:26:29,858 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-09-12 18:26:29,859 INFO L399 AbstractCegarLoop]: === Iteration 35 === Targeting upsweepErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:29,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash 385427080, now seen corresponding path program 1 times [2024-09-12 18:26:29,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:29,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808944220] [2024-09-12 18:26:29,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:29,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:30,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:30,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:30,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:30,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:30,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:30,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 18:26:30,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:30,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808944220] [2024-09-12 18:26:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808944220] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793952058] [2024-09-12 18:26:30,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:30,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:30,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:26:30,164 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:26:30,166 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-09-12 18:26:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:30,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-12 18:26:30,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:26:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:26:30,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:26:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 18:26:30,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793952058] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:26:30,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:26:30,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 29 [2024-09-12 18:26:30,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355994552] [2024-09-12 18:26:30,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:26:30,875 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-12 18:26:30,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:26:30,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-12 18:26:30,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2024-09-12 18:26:30,876 INFO L87 Difference]: Start difference. First operand 241 states and 269 transitions. Second operand has 29 states, 27 states have (on average 4.37037037037037) internal successors, (118), 26 states have internal predecessors, (118), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:26:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:26:32,551 INFO L93 Difference]: Finished difference Result 560 states and 639 transitions. [2024-09-12 18:26:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-12 18:26:32,551 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.37037037037037) internal successors, (118), 26 states have internal predecessors, (118), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 72 [2024-09-12 18:26:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:26:32,554 INFO L225 Difference]: With dead ends: 560 [2024-09-12 18:26:32,554 INFO L226 Difference]: Without dead ends: 415 [2024-09-12 18:26:32,555 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=2027, Unknown=0, NotChecked=0, Total=2352 [2024-09-12 18:26:32,556 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 205 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:26:32,557 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 995 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-09-12 18:26:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-09-12 18:26:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 382. [2024-09-12 18:26:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 337 states have (on average 1.1810089020771513) internal successors, (398), 357 states have internal predecessors, (398), 16 states have call successors, (16), 13 states have call predecessors, (16), 15 states have return successors, (18), 11 states have call predecessors, (18), 14 states have call successors, (18) [2024-09-12 18:26:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 432 transitions. [2024-09-12 18:26:32,665 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 432 transitions. Word has length 72 [2024-09-12 18:26:32,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:26:32,665 INFO L474 AbstractCegarLoop]: Abstraction has 382 states and 432 transitions. [2024-09-12 18:26:32,666 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.37037037037037) internal successors, (118), 26 states have internal predecessors, (118), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:26:32,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 432 transitions. [2024-09-12 18:26:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-12 18:26:32,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:26:32,667 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:26:32,680 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-09-12 18:26:32,867 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-09-12 18:26:32,867 INFO L399 AbstractCegarLoop]: === Iteration 36 === Targeting downsweepErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:26:32,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:26:32,868 INFO L85 PathProgramCache]: Analyzing trace with hash -843801795, now seen corresponding path program 1 times [2024-09-12 18:26:32,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:26:32,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731332258] [2024-09-12 18:26:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:26:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:34,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:26:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:34,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:26:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:34,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:26:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:34,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:26:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:34,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:26:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:34,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:26:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:34,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 18:26:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 18:26:35,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:26:35,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731332258] [2024-09-12 18:26:35,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731332258] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:26:35,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629400340] [2024-09-12 18:26:35,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:26:35,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:26:35,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:26:35,271 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:26:35,272 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-09-12 18:26:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:26:35,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-09-12 18:26:35,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:26:35,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-09-12 18:26:35,488 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:26:35,629 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-09-12 18:26:35,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-09-12 18:26:35,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-09-12 18:26:35,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-09-12 18:26:35,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-09-12 18:26:36,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 25 [2024-09-12 18:26:37,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 28 [2024-09-12 18:26:37,856 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 66 treesize of output 56 [2024-09-12 18:26:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:26:38,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:28:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629400340] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:28:09,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:28:09,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2024-09-12 18:28:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52956761] [2024-09-12 18:28:09,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:28:09,191 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-09-12 18:28:09,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:28:09,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-09-12 18:28:09,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4041, Unknown=13, NotChecked=0, Total=4290 [2024-09-12 18:28:09,193 INFO L87 Difference]: Start difference. First operand 382 states and 432 transitions. Second operand has 56 states, 44 states have (on average 2.272727272727273) internal successors, (100), 48 states have internal predecessors, (100), 9 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-12 18:28:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:28:26,737 INFO L93 Difference]: Finished difference Result 415 states and 468 transitions. [2024-09-12 18:28:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-12 18:28:26,738 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 44 states have (on average 2.272727272727273) internal successors, (100), 48 states have internal predecessors, (100), 9 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 74 [2024-09-12 18:28:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:28:26,740 INFO L225 Difference]: With dead ends: 415 [2024-09-12 18:28:26,740 INFO L226 Difference]: Without dead ends: 413 [2024-09-12 18:28:26,742 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 103.0s TimeCoverageRelationStatistics Valid=502, Invalid=7856, Unknown=14, NotChecked=0, Total=8372 [2024-09-12 18:28:26,742 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 304 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 4017 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 4061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-09-12 18:28:26,743 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1005 Invalid, 4061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 4017 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-09-12 18:28:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-09-12 18:28:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 405. [2024-09-12 18:28:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 358 states have (on average 1.175977653631285) internal successors, (421), 378 states have internal predecessors, (421), 17 states have call successors, (17), 14 states have call predecessors, (17), 16 states have return successors, (20), 12 states have call predecessors, (20), 15 states have call successors, (20) [2024-09-12 18:28:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 458 transitions. [2024-09-12 18:28:26,893 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 458 transitions. Word has length 74 [2024-09-12 18:28:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:28:26,894 INFO L474 AbstractCegarLoop]: Abstraction has 405 states and 458 transitions. [2024-09-12 18:28:26,894 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 44 states have (on average 2.272727272727273) internal successors, (100), 48 states have internal predecessors, (100), 9 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-12 18:28:26,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:28:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 458 transitions. [2024-09-12 18:28:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-12 18:28:26,895 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:28:26,896 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:28:26,915 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-09-12 18:28:27,096 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-09-12 18:28:27,096 INFO L399 AbstractCegarLoop]: === Iteration 37 === Targeting upsweepErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:28:27,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:28:27,097 INFO L85 PathProgramCache]: Analyzing trace with hash -902964022, now seen corresponding path program 1 times [2024-09-12 18:28:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:28:27,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047681295] [2024-09-12 18:28:27,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:28:27,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:28:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:27,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:28:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:27,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:28:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:27,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:28:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:27,211 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:28:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:27,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:28:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:27,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:28:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-12 18:28:27,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:28:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047681295] [2024-09-12 18:28:27,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047681295] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:28:27,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659074935] [2024-09-12 18:28:27,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:28:27,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:28:27,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:28:27,236 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:28:27,237 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-09-12 18:28:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:27,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:28:27,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:28:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-12 18:28:27,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:28:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-12 18:28:27,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659074935] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:28:27,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:28:27,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-09-12 18:28:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666312507] [2024-09-12 18:28:27,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:28:27,813 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 18:28:27,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:28:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 18:28:27,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-12 18:28:27,814 INFO L87 Difference]: Start difference. First operand 405 states and 458 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:28:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:28:28,543 INFO L93 Difference]: Finished difference Result 593 states and 684 transitions. [2024-09-12 18:28:28,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-12 18:28:28,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-09-12 18:28:28,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:28:28,551 INFO L225 Difference]: With dead ends: 593 [2024-09-12 18:28:28,551 INFO L226 Difference]: Without dead ends: 589 [2024-09-12 18:28:28,551 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-09-12 18:28:28,552 INFO L434 NwaCegarLoop]: 56 mSDtfsCounter, 134 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 18:28:28,552 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 270 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 18:28:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-09-12 18:28:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 518. [2024-09-12 18:28:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 471 states have (on average 1.1634819532908705) internal successors, (548), 491 states have internal predecessors, (548), 17 states have call successors, (17), 14 states have call predecessors, (17), 16 states have return successors, (20), 12 states have call predecessors, (20), 15 states have call successors, (20) [2024-09-12 18:28:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 585 transitions. [2024-09-12 18:28:28,698 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 585 transitions. Word has length 73 [2024-09-12 18:28:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:28:28,698 INFO L474 AbstractCegarLoop]: Abstraction has 518 states and 585 transitions. [2024-09-12 18:28:28,698 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 18:28:28,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:28:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 585 transitions. [2024-09-12 18:28:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-12 18:28:28,700 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:28:28,700 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:28:28,718 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-09-12 18:28:28,900 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-09-12 18:28:28,901 INFO L399 AbstractCegarLoop]: === Iteration 38 === Targeting downsweepErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:28:28,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:28:28,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1848129104, now seen corresponding path program 1 times [2024-09-12 18:28:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:28:28,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040336901] [2024-09-12 18:28:28,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:28:28,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:28:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:29,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:28:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:29,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:28:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:29,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:28:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:29,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:28:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:29,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:28:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:29,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:28:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:29,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 18:28:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 18:28:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:28:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040336901] [2024-09-12 18:28:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040336901] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:28:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836760679] [2024-09-12 18:28:29,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:28:29,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:28:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:28:29,356 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:28:29,357 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-09-12 18:28:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:29,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 18:28:29,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:28:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:28:30,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:28:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 18:28:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836760679] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:28:31,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:28:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-09-12 18:28:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265128361] [2024-09-12 18:28:31,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:28:31,205 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-12 18:28:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:28:31,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-12 18:28:31,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-09-12 18:28:31,206 INFO L87 Difference]: Start difference. First operand 518 states and 585 transitions. Second operand has 32 states, 29 states have (on average 4.551724137931035) internal successors, (132), 27 states have internal predecessors, (132), 4 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-12 18:28:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:28:35,372 INFO L93 Difference]: Finished difference Result 738 states and 827 transitions. [2024-09-12 18:28:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-09-12 18:28:35,373 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 4.551724137931035) internal successors, (132), 27 states have internal predecessors, (132), 4 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2024-09-12 18:28:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:28:35,376 INFO L225 Difference]: With dead ends: 738 [2024-09-12 18:28:35,376 INFO L226 Difference]: Without dead ends: 737 [2024-09-12 18:28:35,377 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=618, Invalid=4494, Unknown=0, NotChecked=0, Total=5112 [2024-09-12 18:28:35,378 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 891 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:28:35,378 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 647 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-09-12 18:28:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-09-12 18:28:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 653. [2024-09-12 18:28:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 600 states have (on average 1.1866666666666668) internal successors, (712), 620 states have internal predecessors, (712), 20 states have call successors, (20), 17 states have call predecessors, (20), 19 states have return successors, (22), 15 states have call predecessors, (22), 18 states have call successors, (22) [2024-09-12 18:28:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 754 transitions. [2024-09-12 18:28:35,607 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 754 transitions. Word has length 79 [2024-09-12 18:28:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:28:35,608 INFO L474 AbstractCegarLoop]: Abstraction has 653 states and 754 transitions. [2024-09-12 18:28:35,608 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 4.551724137931035) internal successors, (132), 27 states have internal predecessors, (132), 4 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-12 18:28:35,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:28:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 754 transitions. [2024-09-12 18:28:35,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-09-12 18:28:35,609 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:28:35,610 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:28:35,627 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-09-12 18:28:35,810 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-09-12 18:28:35,810 INFO L399 AbstractCegarLoop]: === Iteration 39 === Targeting upsweepErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2024-09-12 18:28:35,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:28:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1055670344, now seen corresponding path program 2 times [2024-09-12 18:28:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:28:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892006103] [2024-09-12 18:28:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:28:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:28:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:35,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:28:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:35,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:28:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:35,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 18:28:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:35,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:28:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:35,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 18:28:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:35,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 18:28:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:28:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-09-12 18:28:35,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:28:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892006103] [2024-09-12 18:28:35,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892006103] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:28:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142899347] [2024-09-12 18:28:35,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:28:35,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:28:35,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:28:35,997 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:28:35,999 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-09-12 18:28:36,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:28:36,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:28:36,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 18:28:36,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:28:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 18:28:36,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:28:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 18:28:37,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142899347] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:28:37,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:28:37,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 16] total 36 [2024-09-12 18:28:37,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489654098] [2024-09-12 18:28:37,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:28:37,476 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-12 18:28:37,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:28:37,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-12 18:28:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2024-09-12 18:28:37,477 INFO L87 Difference]: Start difference. First operand 653 states and 754 transitions. Second operand has 37 states, 34 states have (on average 3.735294117647059) internal successors, (127), 34 states have internal predecessors, (127), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)