./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/nla-digbench-scaling/divbin_valuebound100.i -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 918183af41ed822b080517d21adc4e88771d95d1ab967de55d618cd7a5912a2d --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 23:30:29,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:30:29,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:30:29,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:30:29,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:30:29,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:30:29,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:30:29,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:30:29,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:30:29,179 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:30:29,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:30:29,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:30:29,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:30:29,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:30:29,182 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:30:29,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:30:29,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:30:29,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:30:29,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:30:29,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:30:29,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:30:29,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:30:29,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:30:29,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:30:29,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:30:29,187 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:30:29,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:30:29,187 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:30:29,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:30:29,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:30:29,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:30:29,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:30:29,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:30:29,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:30:29,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:30:29,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:30:29,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:30:29,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:30:29,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:30:29,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:30:29,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:30:29,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:30:29,190 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 -> 918183af41ed822b080517d21adc4e88771d95d1ab967de55d618cd7a5912a2d 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.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 23:30:29,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:30:29,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:30:29,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:30:29,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:30:29,439 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:30:29,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i [2024-09-24 23:30:30,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:30:30,794 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:30:30,794 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i [2024-09-24 23:30:30,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1bb527837/ca09f3c1177d4f59b98856c484e873ef/FLAG8487c31d4 [2024-09-24 23:30:31,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1bb527837/ca09f3c1177d4f59b98856c484e873ef [2024-09-24 23:30:31,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:30:31,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:30:31,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:30:31,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:30:31,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:30:31,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ee07d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31, skipping insertion in model container [2024-09-24 23:30:31,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:30:31,348 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i[950,963] [2024-09-24 23:30:31,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:30:31,378 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:30:31,389 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i[950,963] [2024-09-24 23:30:31,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:30:31,411 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:30:31,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31 WrapperNode [2024-09-24 23:30:31,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:30:31,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:30:31,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:30:31,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:30:31,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,429 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:30:31,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:30:31,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:30:31,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:30:31,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:30:31,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,449 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-24 23:30:31,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:30:31,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:30:31,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:30:31,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:30:31,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (1/1) ... [2024-09-24 23:30:31,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:30:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:30:31,482 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-24 23:30:31,483 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-24 23:30:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:30:31,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:30:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:30:31,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:30:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:30:31,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:30:31,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:30:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:30:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:30:31,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:30:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:30:31,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:30:31,564 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:30:31,566 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:30:31,694 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-24 23:30:31,694 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:30:31,718 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:30:31,719 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-24 23:30:31,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:30:31 BoogieIcfgContainer [2024-09-24 23:30:31,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:30:31,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:30:31,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:30:31,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:30:31,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:30:31" (1/3) ... [2024-09-24 23:30:31,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e9ebe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:30:31, skipping insertion in model container [2024-09-24 23:30:31,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:30:31" (2/3) ... [2024-09-24 23:30:31,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e9ebe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:30:31, skipping insertion in model container [2024-09-24 23:30:31,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:30:31" (3/3) ... [2024-09-24 23:30:31,729 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound100.i [2024-09-24 23:30:31,743 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:30:31,743 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:30:31,782 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:30:31,786 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;@69cf48f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:30:31,788 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:30:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-24 23:30:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-24 23:30:31,797 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:31,797 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:30:31,798 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:31,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:31,802 INFO L85 PathProgramCache]: Analyzing trace with hash -923394275, now seen corresponding path program 1 times [2024-09-24 23:30:31,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:31,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134224192] [2024-09-24 23:30:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:31,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:31,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:30:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:31,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:30:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:31,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:30:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:31,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:30:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:31,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:30:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-24 23:30:31,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:31,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134224192] [2024-09-24 23:30:31,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134224192] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:30:31,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:30:31,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 23:30:31,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861030308] [2024-09-24 23:30:31,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:30:31,943 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 23:30:31,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:31,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 23:30:31,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:30:31,962 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-24 23:30:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:31,981 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2024-09-24 23:30:31,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 23:30:31,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-24 23:30:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:31,988 INFO L225 Difference]: With dead ends: 58 [2024-09-24 23:30:31,989 INFO L226 Difference]: Without dead ends: 28 [2024-09-24 23:30:31,991 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:30:31,993 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:31,993 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:30:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-24 23:30:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-24 23:30:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-24 23:30:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-24 23:30:32,025 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 33 [2024-09-24 23:30:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:32,025 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-24 23:30:32,025 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-24 23:30:32,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-24 23:30:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-24 23:30:32,029 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:32,029 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:30:32,029 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:30:32,029 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:32,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1193042891, now seen corresponding path program 1 times [2024-09-24 23:30:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:32,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281115827] [2024-09-24 23:30:32,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:32,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:30:32,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121037257] [2024-09-24 23:30:32,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:32,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:30:32,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:30:32,115 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-24 23:30:32,117 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-24 23:30:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:32,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 23:30:32,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:30:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-24 23:30:32,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:30:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-24 23:30:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:32,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281115827] [2024-09-24 23:30:32,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:30:32,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121037257] [2024-09-24 23:30:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121037257] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-24 23:30:32,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:30:32,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-09-24 23:30:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774795037] [2024-09-24 23:30:32,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:30:32,520 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:30:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:32,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:30:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:30:32,523 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-24 23:30:36,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-09-24 23:30:40,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-09-24 23:30:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:40,623 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-09-24 23:30:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:30:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2024-09-24 23:30:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:40,625 INFO L225 Difference]: With dead ends: 38 [2024-09-24 23:30:40,625 INFO L226 Difference]: Without dead ends: 36 [2024-09-24 23:30:40,625 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:30:40,626 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:40,626 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2024-09-24 23:30:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-24 23:30:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-09-24 23:30:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:30:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-09-24 23:30:40,639 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 34 [2024-09-24 23:30:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:40,640 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-09-24 23:30:40,640 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-24 23:30:40,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-09-24 23:30:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-24 23:30:40,642 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:40,642 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-09-24 23:30:40,657 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-24 23:30:40,847 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:30:40,848 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:40,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash 616506317, now seen corresponding path program 1 times [2024-09-24 23:30:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298605904] [2024-09-24 23:30:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:30:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:30:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,059 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:30:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:30:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:30:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-24 23:30:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-24 23:30:41,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298605904] [2024-09-24 23:30:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298605904] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:30:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432710654] [2024-09-24 23:30:41,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:41,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:30:41,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:30:41,094 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-24 23:30:41,099 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-24 23:30:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-24 23:30:41,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:30:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-24 23:30:41,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:30:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-24 23:30:41,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432710654] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:30:41,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:30:41,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2024-09-24 23:30:41,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666333548] [2024-09-24 23:30:41,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:30:41,268 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 23:30:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 23:30:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:30:41,270 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-24 23:30:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:41,373 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-09-24 23:30:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 23:30:41,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2024-09-24 23:30:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:41,375 INFO L225 Difference]: With dead ends: 48 [2024-09-24 23:30:41,376 INFO L226 Difference]: Without dead ends: 41 [2024-09-24 23:30:41,376 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:30:41,377 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:41,377 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 164 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:30:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-24 23:30:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-09-24 23:30:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:30:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-09-24 23:30:41,389 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 40 [2024-09-24 23:30:41,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:41,389 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-09-24 23:30:41,390 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-24 23:30:41,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-09-24 23:30:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-24 23:30:41,392 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:41,392 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:30:41,405 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-24 23:30:41,593 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:30:41,594 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:41,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:41,595 INFO L85 PathProgramCache]: Analyzing trace with hash 513117096, now seen corresponding path program 1 times [2024-09-24 23:30:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:41,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524966627] [2024-09-24 23:30:41,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:30:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:30:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:30:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,906 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:30:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:30:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-24 23:30:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-24 23:30:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:30:41,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524966627] [2024-09-24 23:30:41,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524966627] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:30:41,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:30:41,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 23:30:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164592709] [2024-09-24 23:30:41,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:30:41,924 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 23:30:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:30:41,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 23:30:41,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-24 23:30:41,924 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:30:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:30:41,966 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-09-24 23:30:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 23:30:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-09-24 23:30:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:30:41,967 INFO L225 Difference]: With dead ends: 48 [2024-09-24 23:30:41,968 INFO L226 Difference]: Without dead ends: 35 [2024-09-24 23:30:41,968 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-24 23:30:41,969 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:30:41,970 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:30:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-24 23:30:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-24 23:30:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:30:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-09-24 23:30:41,977 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 42 [2024-09-24 23:30:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:30:41,978 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-09-24 23:30:41,978 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:30:41,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-09-24 23:30:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-24 23:30:41,979 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:30:41,979 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 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, 1] [2024-09-24 23:30:41,979 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-24 23:30:41,979 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:30:41,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:30:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash 980542403, now seen corresponding path program 1 times [2024-09-24 23:30:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:30:41,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66611781] [2024-09-24 23:30:41,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:30:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:30:42,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882672828] [2024-09-24 23:30:42,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:30:42,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:30:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:30:42,003 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-24 23:30:42,004 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-24 23:30:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:30:42,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-24 23:30:42,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:30:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-24 23:30:42,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:31:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:31:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66611781] [2024-09-24 23:31:10,647 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:31:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882672828] [2024-09-24 23:31:10,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882672828] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:31:10,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:31:10,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-09-24 23:31:10,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650497962] [2024-09-24 23:31:10,647 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-24 23:31:10,648 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-24 23:31:10,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:31:10,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-24 23:31:10,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=195, Unknown=5, NotChecked=0, Total=240 [2024-09-24 23:31:10,648 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-24 23:31:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:31:10,777 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-09-24 23:31:10,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 23:31:10,778 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-09-24 23:31:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:31:10,779 INFO L225 Difference]: With dead ends: 48 [2024-09-24 23:31:10,779 INFO L226 Difference]: Without dead ends: 46 [2024-09-24 23:31:10,779 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=46, Invalid=221, Unknown=5, NotChecked=0, Total=272 [2024-09-24 23:31:10,779 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:31:10,780 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 153 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:31:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-24 23:31:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-09-24 23:31:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-24 23:31:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-09-24 23:31:10,795 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 44 [2024-09-24 23:31:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:31:10,796 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-09-24 23:31:10,796 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-24 23:31:10,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:31:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-09-24 23:31:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-24 23:31:10,799 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:31:10,799 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-09-24 23:31:10,809 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-24 23:31:10,999 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:31:11,000 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:31:11,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:31:11,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2109238368, now seen corresponding path program 2 times [2024-09-24 23:31:11,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:31:11,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412144178] [2024-09-24 23:31:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:31:11,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:31:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:31:11,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:31:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:31:11,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:31:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:31:11,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:31:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:31:11,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:31:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:31:11,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:31:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:31:11,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-24 23:31:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:31:11,337 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-24 23:31:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:31:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-24 23:31:11,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:31:11,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412144178] [2024-09-24 23:31:11,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412144178] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:31:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681787396] [2024-09-24 23:31:11,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 23:31:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:31:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:31:11,344 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-24 23:31:11,345 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-24 23:31:11,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 23:31:11,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:31:11,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-24 23:31:11,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:31:11,861 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-24 23:31:11,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:31:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-24 23:31:12,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681787396] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:31:12,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:31:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 18 [2024-09-24 23:31:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661298509] [2024-09-24 23:31:12,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:31:12,161 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-24 23:31:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:31:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-24 23:31:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-09-24 23:31:12,162 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2024-09-24 23:31:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:31:12,612 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2024-09-24 23:31:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 23:31:12,614 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 52 [2024-09-24 23:31:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:31:12,615 INFO L225 Difference]: With dead ends: 82 [2024-09-24 23:31:12,615 INFO L226 Difference]: Without dead ends: 52 [2024-09-24 23:31:12,615 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2024-09-24 23:31:12,616 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-24 23:31:12,616 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 190 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-24 23:31:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-24 23:31:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-09-24 23:31:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-24 23:31:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-09-24 23:31:12,633 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 52 [2024-09-24 23:31:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:31:12,634 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-09-24 23:31:12,634 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2024-09-24 23:31:12,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:31:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-09-24 23:31:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-24 23:31:12,636 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:31:12,636 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2024-09-24 23:31:12,642 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-24 23:31:12,837 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:31:12,837 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:31:12,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:31:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash -860568069, now seen corresponding path program 3 times [2024-09-24 23:31:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:31:12,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359993255] [2024-09-24 23:31:12,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:31:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:31:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:31:12,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819606347] [2024-09-24 23:31:12,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-24 23:31:12,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:31:12,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:31:12,936 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-24 23:31:12,937 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-24 23:31:13,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-24 23:31:13,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:31:13,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-24 23:31:13,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:31:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-24 23:31:14,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:31:46,763 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:32:02,784 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:32:18,817 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:32:30,939 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:32:47,002 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:32:51,022 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~b~0 1073741824))) (let ((.cse3 (mod c_main_~A~0 4294967296)) (.cse2 (mod c_main_~r~0 4294967296)) (.cse0 (* .cse1 2))) (or (= .cse0 (mod c_main_~B~0 4294967296)) (< (* .cse1 4) (+ 1 .cse2)) (< .cse2 (mod c_main_~b~0 4294967296)) (not (= (mod (+ (* c_main_~b~0 c_main_~q~0 4) c_main_~r~0) 4294967296) .cse3)) (= .cse3 (mod (+ (* .cse1 c_main_~q~0 4) c_main_~r~0) 4294967296)) (< .cse2 .cse0)))) is different from true [2024-09-24 23:33:07,078 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:33:23,121 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:33:39,175 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:34:00,059 WARN L293 SmtUtils]: Spent 12.81s on a formula simplification. DAG size of input: 11 DAG size of output: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:34:04,071 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_main_~b~0 1073741824))) (let ((.cse2 (mod c_main_~A~0 4294967296)) (.cse0 (mod c_main_~r~0 4294967296)) (.cse1 (* .cse3 2))) (or (< (* c_main_~b~0 4) (+ 1 .cse0)) (= .cse1 (mod c_main_~B~0 4294967296)) (< .cse0 (mod c_main_~b~0 4294967296)) (not (= (mod (+ (* c_main_~b~0 c_main_~q~0 4) c_main_~r~0) 4294967296) .cse2)) (= .cse2 (mod (+ (* .cse3 c_main_~q~0 4) c_main_~r~0) 4294967296)) (< .cse0 .cse1)))) is different from true [2024-09-24 23:34:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 4 not checked. [2024-09-24 23:34:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:34:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359993255] [2024-09-24 23:34:04,106 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:34:04,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819606347] [2024-09-24 23:34:04,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819606347] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:34:04,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:34:04,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2024-09-24 23:34:04,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269238679] [2024-09-24 23:34:04,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:34:04,106 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-24 23:34:04,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:34:04,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-24 23:34:04,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=538, Unknown=2, NotChecked=98, Total=756 [2024-09-24 23:34:04,107 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13)